Base | Representation |
---|---|
bin | 10111001100011100001111… |
… | …000000010111100101001001 |
3 | 111101012001200200120020010110 |
4 | 113030130033000113211021 |
5 | 101332313010110031441 |
6 | 1000542431203104533 |
7 | 30325660251230430 |
oct | 2714341700274511 |
9 | 441161620506113 |
10 | 102010020002121 |
11 | 2a55a22a993950 |
12 | b536285372149 |
13 | 44bc67157bb4a |
14 | 1b29450350117 |
15 | bbd7ac2abb16 |
hex | 5cc70f017949 |
102010020002121 has 32 divisors (see below), whose sum is σ = 169578038624256. Its totient is φ = 52991299296000.
The previous prime is 102010020002101. The next prime is 102010020002167. The reversal of 102010020002121 is 121200020010201.
It is not a de Polignac number, because 102010020002121 - 29 = 102010020001609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102010020002097 and 102010020002106.
It is not an unprimeable number, because it can be changed into a prime (102010020002101) 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, 9624001 + ... + 17223281.
It is an arithmetic number, because the mean of its divisors is an integer number (5299313707008).
Almost surely, 2102010020002121 is an apocalyptic number.
102010020002121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102010020002121 is a deficient number, since it is larger than the sum of its proper divisors (67568018622135).
102010020002121 is a wasteful number, since it uses less digits than its factorization.
102010020002121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7657413.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 102010020002121 its reverse (121200020010201), we get a palindrome (223210040012322).
The spelling of 102010020002121 in words is "one hundred two trillion, ten billion, twenty million, two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •