Base | Representation |
---|---|
bin | 10001100001011010000… |
… | …100101001111000010000 |
3 | 11021002222221100221011211 |
4 | 101201122010221320100 |
5 | 124212000103344212 |
6 | 2321053512545504 |
7 | 152664525142654 |
oct | 21413204517020 |
9 | 4232887327154 |
10 | 1204102012432 |
11 | 424725216810 |
12 | 1754433b2294 |
13 | 897143a5bb7 |
14 | 423c9234a64 |
15 | 214c4db19a7 |
hex | 1185a129e10 |
1204102012432 has 80 divisors (see below), whose sum is σ = 2685349465920. Its totient is φ = 517280601600.
The previous prime is 1204102012429. The next prime is 1204102012471. The reversal of 1204102012432 is 2342102014021.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 980178 + ... + 1835470.
It is an arithmetic number, because the mean of its divisors is an integer number (33566868324).
Almost surely, 21204102012432 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 1204102012432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1342674732960).
1204102012432 is an abundant number, since it is smaller than the sum of its proper divisors (1481247453488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1204102012432 is a wasteful number, since it uses less digits than its factorization.
1204102012432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855752 (or 855746 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 1204102012432 its reverse (2342102014021), we get a palindrome (3546204026453).
The spelling of 1204102012432 in words is "one trillion, two hundred four billion, one hundred two million, twelve thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •