Base | Representation |
---|---|
bin | 10110010110100100… |
… | …01010000111011000 |
3 | 1010222100000000100000 |
4 | 23023102022013120 |
5 | 144034110010324 |
6 | 5302443413000 |
7 | 603245210304 |
oct | 131322120730 |
9 | 33870000300 |
10 | 12000469464 |
11 | 50a8a52365 |
12 | 23aab24160 |
13 | 119329a409 |
14 | 81bb00d04 |
15 | 4a38149c9 |
hex | 2cb48a1d8 |
12000469464 has 192 divisors, whose sum is σ = 35603568000. Its totient is φ = 3776336640.
The previous prime is 12000469421. The next prime is 12000469477. The reversal of 12000469464 is 46496400021.
It is a super-2 number, since 2×120004694642 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 21016299 + ... + 21016869.
It is an arithmetic number, because the mean of its divisors is an integer number (185435250).
Almost surely, 212000469464 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12000469464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17801784000).
12000469464 is an abundant number, since it is smaller than the sum of its proper divisors (23603098536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000469464 is a wasteful number, since it uses less digits than its factorization.
12000469464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1180 (or 1164 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 36.
Adding to 12000469464 its reverse (46496400021), we get a palindrome (58496869485).
The spelling of 12000469464 in words is "twelve billion, four hundred sixty-nine thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •