Base | Representation |
---|---|
bin | 10111001111010000001010… |
… | …000001110100000010111100 |
3 | 111101212112100102200010121122 |
4 | 113033100022001310002330 |
5 | 101343444133231214400 |
6 | 1001211301223450112 |
7 | 30345636551301254 |
oct | 2717201201640274 |
9 | 441775312603548 |
10 | 102203210023100 |
11 | 2a62415769800a |
12 | b5678002b6938 |
13 | 450494ba67224 |
14 | 1b34939c1a964 |
15 | bc381794e685 |
hex | 5cf40a0740bc |
102203210023100 has 36 divisors (see below), whose sum is σ = 221786237975400. Its totient is φ = 40880312170560.
The previous prime is 102203210023099. The next prime is 102203210023127. The reversal of 102203210023100 is 1320012302201.
It is a super-2 number, since 2×1022032100231002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7913015 + ... + 16340814.
It is an arithmetic number, because the mean of its divisors is an integer number (6160728832650).
Almost surely, 2102203210023100 is an apocalyptic number.
102203210023100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102203210023100 is an abundant number, since it is smaller than the sum of its proper divisors (119583027952300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102203210023100 is a wasteful number, since it uses less digits than its factorization.
102203210023100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24295982 (or 24295975 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 102203210023100 its reverse (1320012302201), we get a palindrome (103523222325301).
The spelling of 102203210023100 in words is "one hundred two trillion, two hundred three billion, two hundred ten million, twenty-three thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •