Base | Representation |
---|---|
bin | 11101001000101110110… |
… | …10011111100110001100 |
3 | 10112201001210021112111200 |
4 | 32210113122133212030 |
5 | 112400243232413400 |
6 | 2043524104145500 |
7 | 132220456206315 |
oct | 16442732374614 |
9 | 3481053245450 |
10 | 1001120201100 |
11 | 356633288628 |
12 | 142035168290 |
13 | 735363a0326 |
14 | 3665112360c |
15 | 1b094c8cb00 |
hex | e91769f98c |
1001120201100 has 108 divisors (see below), whose sum is σ = 3303111269640. Its totient is φ = 252914572800.
The previous prime is 1001120201057. The next prime is 1001120201143. The reversal of 1001120201100 is 11020211001.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1001120201057) and next prime (1001120201143).
It is a Harshad number since it is a multiple of its sum of digits (9).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 29255421 + ... + 29289620.
Almost surely, 21001120201100 is an apocalyptic number.
1001120201100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1001120201100 is an abundant number, since it is smaller than the sum of its proper divisors (2301991068540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1001120201100 is a wasteful number, since it uses less digits than its factorization.
1001120201100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58545080 (or 58545070 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1001120201100 its reverse (11020211001), we get a palindrome (1012140412101).
Subtracting from 1001120201100 its reverse (11020211001), we obtain a palindrome (990099990099).
The spelling of 1001120201100 in words is "one trillion, one billion, one hundred twenty million, two hundred one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •