Base | Representation |
---|---|
bin | 10001011110100010010… |
… | …000100100111000000000 |
3 | 11020211001000111110200000 |
4 | 101132202100210320000 |
5 | 124134141120124140 |
6 | 2315423510400000 |
7 | 152525230443600 |
oct | 21364220447000 |
9 | 4224030443600 |
10 | 1201018129920 |
11 | 423392473184 |
12 | 174922660000 |
13 | 8934250204b |
14 | 421b5834c00 |
15 | 2139429da30 |
hex | 117a2424e00 |
1201018129920 has 2160 divisors, whose sum is σ = 5311310148144. Its totient is φ = 259183411200.
The previous prime is 1201018129907. The next prime is 1201018129967. The reversal of 1201018129920 is 299218101021.
It is a tau number, because it is divible by the number of its divisors (2160).
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 215 ways as a sum of consecutive naturals, for example, 29293125100 + ... + 29293125140.
Almost surely, 21201018129920 is an apocalyptic number.
1201018129920 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 1201018129920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2655655074072).
1201018129920 is an abundant number, since it is smaller than the sum of its proper divisors (4110292018224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201018129920 is an frugal number, since it uses more digits than its factorization.
1201018129920 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155 (or 89 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 36.
The spelling of 1201018129920 in words is "one trillion, two hundred one billion, eighteen million, one hundred twenty-nine thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •