Base | Representation |
---|---|
bin | 1011000001111… |
… | …0111100000000 |
3 | 10020001110100212 |
4 | 2300132330000 |
5 | 43320422224 |
6 | 4331333252 |
7 | 1101144440 |
oct | 260367400 |
9 | 106043325 |
10 | 46264064 |
11 | 24129970 |
12 | 135b1228 |
13 | 977aab2 |
14 | 6204120 |
15 | 40dcd0e |
hex | 2c1ef00 |
46264064 has 72 divisors (see below), whose sum is σ = 115183488. Its totient is φ = 18017280.
The previous prime is 46264037. The next prime is 46264073. The reversal of 46264064 is 46046264.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 46264064.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18539 + ... + 20885.
Almost surely, 246264064 is an apocalyptic number.
46264064 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 46264064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57591744).
46264064 is an abundant number, since it is smaller than the sum of its proper divisors (68919424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46264064 is a wasteful number, since it uses less digits than its factorization.
46264064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2381 (or 2367 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 32.
The square root of 46264064 is about 6801.7691816174. The cubic root of 46264064 is about 358.9890981396.
The spelling of 46264064 in words is "forty-six million, two hundred sixty-four thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •