Base | Representation |
---|---|
bin | 10110111101111001000000… |
… | …010100101001000000110101 |
3 | 111020122110202221100020102002 |
4 | 112331321000110221000311 |
5 | 101214422211211120041 |
6 | 554455224124225045 |
7 | 30163511636506652 |
oct | 2675710024510065 |
9 | 436573687306362 |
10 | 101010120020021 |
11 | 2a204173471983 |
12 | b3b453099b185 |
13 | 44492a0c31cc4 |
14 | 1ad2cb7300c29 |
15 | ba278970059b |
hex | 5bde40529035 |
101010120020021 has 2 divisors, whose sum is σ = 101010120020022. Its totient is φ = 101010120020020.
The previous prime is 101010120019961. The next prime is 101010120020053. The reversal of 101010120020021 is 120020021010101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100041104223025 + 969015796996 = 10002055^2 + 984386^2 .
It is a cyclic number.
It is not a de Polignac number, because 101010120020021 - 230 = 101009046278197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101010120019984 and 101010120020011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101010120020921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50505060010010 + 50505060010011.
It is an arithmetic number, because the mean of its divisors is an integer number (50505060010011).
Almost surely, 2101010120020021 is an apocalyptic number.
It is an amenable number.
101010120020021 is a deficient number, since it is larger than the sum of its proper divisors (1).
101010120020021 is an equidigital number, since it uses as much as digits as its factorization.
101010120020021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101010120020021 its reverse (120020021010101), we get a palindrome (221030141030122).
The spelling of 101010120020021 in words is "one hundred one trillion, ten billion, one hundred twenty million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •