Base | Representation |
---|---|
bin | 10111001110000011100110… |
… | …101001010100001110000100 |
3 | 111101120200011220121221100011 |
4 | 113032003212221110032010 |
5 | 101341122313034120400 |
6 | 1001105424551200004 |
7 | 30336666606635533 |
oct | 2716034651241604 |
9 | 441520156557304 |
10 | 102121012020100 |
11 | 2a5a2306aa5827 |
12 | b5538a0376004 |
13 | 44c9c7c44ca28 |
14 | 1b3097d1a431a |
15 | bc160650a8ba |
hex | 5ce0e6a54384 |
102121012020100 has 18 divisors (see below), whose sum is σ = 221602596083834. Its totient is φ = 40848404808000.
The previous prime is 102121012020073. The next prime is 102121012020103. The reversal of 102121012020100 is 1020210121201.
It can be written as a sum of positive squares in 3 ways, for example, as 20871448086784 + 81249563933316 = 4568528^2 + 9013854^2 .
It is not an unprimeable number, because it can be changed into a prime (102121012020103) 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, 510605060001 + ... + 510605060200.
Almost surely, 2102121012020100 is an apocalyptic number.
102121012020100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102121012020100 is an abundant number, since it is smaller than the sum of its proper divisors (119481584063734).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102121012020100 is a wasteful number, since it uses less digits than its factorization.
102121012020100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021210120215 (or 1021210120208 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102121012020100 its reverse (1020210121201), we get a palindrome (103141222141301).
The spelling of 102121012020100 in words is "one hundred two trillion, one hundred twenty-one billion, twelve million, twenty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •