Base | Representation |
---|---|
bin | 11101011011001000110… |
… | …11010101010001110000 |
3 | 10120122120111000011012101 |
4 | 32231210123111101300 |
5 | 113031013030414300 |
6 | 2052240433510144 |
7 | 133020401630245 |
oct | 16554433252160 |
9 | 3518514004171 |
10 | 1011002201200 |
11 | 35a844427562 |
12 | 143b32712354 |
13 | 7444c7b4074 |
14 | 36d0b72b5cc |
15 | 1b4725dcb6a |
hex | eb646d5470 |
1011002201200 has 30 divisors (see below), whose sum is σ = 2428932789344. Its totient is φ = 404400880320.
The previous prime is 1011002201177. The next prime is 1011002201203. The reversal of 1011002201200 is 21022001101.
1011002201200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011002201203) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1263752352 + ... + 1263753151.
Almost surely, 21011002201200 is an apocalyptic number.
1011002201200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1011002201200 is an abundant number, since it is smaller than the sum of its proper divisors (1417930588144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011002201200 is a wasteful number, since it uses less digits than its factorization.
1011002201200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2527505521 (or 2527505510 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1011002201200 its reverse (21022001101), we get a palindrome (1032024202301).
The spelling of 1011002201200 in words is "one trillion, eleven billion, two million, two hundred one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •