Base | Representation |
---|---|
bin | 10001011110100111001… |
… | …001010001001000011000 |
3 | 11020211020201201222122100 |
4 | 101132213021101020120 |
5 | 124134323111200440 |
6 | 2315435555323400 |
7 | 152530244254014 |
oct | 21364711211030 |
9 | 4224221658570 |
10 | 1201100100120 |
11 | 42342476a648 |
12 | 174945bb0560 |
13 | 893564a211b |
14 | 421c2691544 |
15 | 2139b591230 |
hex | 117a7251218 |
1201100100120 has 192 divisors, whose sum is σ = 4105527379200. Its totient is φ = 304112839680.
The previous prime is 1201100100103. The next prime is 1201100100169. The reversal of 1201100100120 is 210010011021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 423855 + ... + 1606814.
It is an arithmetic number, because the mean of its divisors is an integer number (21382955100).
Almost surely, 21201100100120 is an apocalyptic number.
1201100100120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1201100100120 is an abundant number, since it is smaller than the sum of its proper divisors (2904427279080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201100100120 is a wasteful number, since it uses less digits than its factorization.
1201100100120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2030770 (or 2030763 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1201100100120 its reverse (210010011021), we get a palindrome (1411110111141).
The spelling of 1201100100120 in words is "one trillion, two hundred one billion, one hundred million, one hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •