Base | Representation |
---|---|
bin | 11101110001111000010… |
… | …00111110011000110100 |
3 | 10121211002100101122212220 |
4 | 32320330020332120310 |
5 | 113231014031431400 |
6 | 2102020131042340 |
7 | 133632061500123 |
oct | 16707410763064 |
9 | 3554070348786 |
10 | 1023211202100 |
11 | 364a3a05964a |
12 | 14637b4403b0 |
13 | 75647034a59 |
14 | 37748dd1aba |
15 | 1b9393947a0 |
hex | ee3c23e634 |
1023211202100 has 72 divisors (see below), whose sum is σ = 3062577003360. Its totient is φ = 263447479680.
The previous prime is 1023211202099. The next prime is 1023211202119. The reversal of 1023211202100 is 12021123201.
It is a super-2 number, since 2×10232112021002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1023211202100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58796542 + ... + 58813941.
Almost surely, 21023211202100 is an apocalyptic number.
1023211202100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1023211202100 is an abundant number, since it is smaller than the sum of its proper divisors (2039365801260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023211202100 is a wasteful number, since it uses less digits than its factorization.
1023211202100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117610529 (or 117610522 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 1023211202100 its reverse (12021123201), we get a palindrome (1035232325301).
The spelling of 1023211202100 in words is "one trillion, twenty-three billion, two hundred eleven million, two hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •