Base | Representation |
---|---|
bin | 10111001100011100010011… |
… | …111001001111111111010101 |
3 | 111101012001220101220021101111 |
4 | 113030130103321033333111 |
5 | 101332313142104201401 |
6 | 1000542443253055021 |
7 | 30325662265335640 |
oct | 2714342371177725 |
9 | 441161811807344 |
10 | 102010102022101 |
11 | 2a55a272214759 |
12 | b5362a8927471 |
13 | 44bc685568790 |
14 | 1b2945b1c0a57 |
15 | bbd7b45ade51 |
hex | 5cc713e4ffd5 |
102010102022101 has 64 divisors (see below), whose sum is σ = 128284136741376. Its totient is φ = 78972209971200.
The previous prime is 102010102022041. The next prime is 102010102022131. The reversal of 102010102022101 is 101220201010201.
It is not a de Polignac number, because 102010102022101 - 211 = 102010102020053 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102010102022131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2924835675 + ... + 2924870551.
It is an arithmetic number, because the mean of its divisors is an integer number (2004439636584).
Almost surely, 2102010102022101 is an apocalyptic number.
It is an amenable number.
102010102022101 is a deficient number, since it is larger than the sum of its proper divisors (26274034719275).
102010102022101 is a wasteful number, since it uses less digits than its factorization.
102010102022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38462.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102010102022101 its reverse (101220201010201), we get a palindrome (203230303032302).
The spelling of 102010102022101 in words is "one hundred two trillion, ten billion, one hundred two million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •