Base | Representation |
---|---|
bin | 10001100000100110001… |
… | …010011001010000110000 |
3 | 11021000202020121002122220 |
4 | 101200212022121100300 |
5 | 124203204130231000 |
6 | 2320431242201040 |
7 | 152634121421334 |
oct | 21404612312060 |
9 | 4230666532586 |
10 | 1203231102000 |
11 | 424318652924 |
12 | 17523b7b3180 |
13 | 89605b25c95 |
14 | 423456cb7c4 |
15 | 214736ce1a0 |
hex | 11826299430 |
1203231102000 has 160 divisors (see below), whose sum is σ = 3882392177664. Its totient is φ = 320599008000.
The previous prime is 1203231101911. The next prime is 1203231102037. The reversal of 1203231102000 is 2011323021.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7304547 + ... + 7467453.
Almost surely, 21203231102000 is an apocalyptic number.
1203231102000 is a gapful number since it is divisible by the number (10) 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 1203231102000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1941196088832).
1203231102000 is an abundant number, since it is smaller than the sum of its proper divisors (2679161075664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1203231102000 is a wasteful number, since it uses less digits than its factorization.
1203231102000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164164 (or 164148 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1203231102000 its reverse (2011323021), we get a palindrome (1205242425021).
The spelling of 1203231102000 in words is "one trillion, two hundred three billion, two hundred thirty-one million, one hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •