Base | Representation |
---|---|
bin | 10110111111001110100100… |
… | …110011010101001100011011 |
3 | 111020222020221012220220120210 |
4 | 112333032210303111030123 |
5 | 101222423344011200443 |
6 | 555005341225222203 |
7 | 30203243545346421 |
oct | 2677164463251433 |
9 | 436866835826523 |
10 | 101102000100123 |
11 | 2a23a132372a80 |
12 | b40a2b3331963 |
13 | 4454b54401cc9 |
14 | 1ad7511b9d111 |
15 | ba4d65b52c33 |
hex | 5bf3a4cd531b |
101102000100123 has 32 divisors (see below), whose sum is σ = 150187802959872. Its totient is φ = 59969653133600.
The previous prime is 101102000100121. The next prime is 101102000100139. The reversal of 101102000100123 is 321001000201101.
It is a cyclic number.
It is not a de Polignac number, because 101102000100123 - 21 = 101102000100121 is a prime.
It is a super-2 number, since 2×1011020001001232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101102000100099 and 101102000100108.
It is not an unprimeable number, because it can be changed into a prime (101102000100121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 198725290 + ... + 199233392.
It is an arithmetic number, because the mean of its divisors is an integer number (4693368842496).
Almost surely, 2101102000100123 is an apocalyptic number.
101102000100123 is a deficient number, since it is larger than the sum of its proper divisors (49085802859749).
101102000100123 is a wasteful number, since it uses less digits than its factorization.
101102000100123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 636455.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 101102000100123 its reverse (321001000201101), we get a palindrome (422103000301224).
The spelling of 101102000100123 in words is "one hundred one trillion, one hundred two billion, one hundred thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •