Base | Representation |
---|---|
bin | 10111001101111011010100… |
… | …000011001100001000001001 |
3 | 111101112211012112002121000210 |
4 | 113031323110003030020021 |
5 | 101341001100141213001 |
6 | 1001101353352151333 |
7 | 30336233164604610 |
oct | 2715732403141011 |
9 | 441484175077023 |
10 | 102112110101001 |
11 | 2a5995591051a0 |
12 | b552017098549 |
13 | 44c91910c0890 |
14 | 1b30376c00877 |
15 | bc1284c54dd6 |
hex | 5cded40cc209 |
102112110101001 has 128 divisors (see below), whose sum is σ = 187234983936000. Its totient is φ = 47779680211200.
The previous prime is 102112110100939. The next prime is 102112110101039. The reversal of 102112110101001 is 100101011211201.
It is not a de Polignac number, because 102112110101001 - 210 = 102112110099977 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102112110101401) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 132748500 + ... + 133515498.
It is an arithmetic number, because the mean of its divisors is an integer number (1462773312000).
Almost surely, 2102112110101001 is an apocalyptic number.
102112110101001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102112110101001 is a deficient number, since it is larger than the sum of its proper divisors (85122873834999).
102112110101001 is a wasteful number, since it uses less digits than its factorization.
102112110101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 768107.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 102112110101001 its reverse (100101011211201), we get a palindrome (202213121312202).
The spelling of 102112110101001 in words is "one hundred two trillion, one hundred twelve billion, one hundred ten million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •