Base | Representation |
---|---|
bin | 1001001111001010000110… |
… | …10101011000100111010101 |
3 | 2122220210220021222222022222 |
4 | 10213211003111120213111 |
5 | 10130243014141201401 |
6 | 111111115012232125 |
7 | 4164332016321056 |
oct | 447450325304725 |
9 | 78823807888288 |
10 | 20312030022101 |
11 | 6521313460a64 |
12 | 234073590b645 |
13 | b445545591cc |
14 | 503170d9472d |
15 | 253568745c1b |
hex | 1279435589d5 |
20312030022101 has 2 divisors, whose sum is σ = 20312030022102. Its totient is φ = 20312030022100.
The previous prime is 20312030022049. The next prime is 20312030022107. The reversal of 20312030022101 is 10122003021302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20139684651076 + 172345371025 = 4487726^2 + 415145^2 .
It is a cyclic number.
It is not a de Polignac number, because 20312030022101 - 226 = 20311962913237 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20312030022101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20312030022107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10156015011050 + 10156015011051.
It is an arithmetic number, because the mean of its divisors is an integer number (10156015011051).
Almost surely, 220312030022101 is an apocalyptic number.
It is an amenable number.
20312030022101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20312030022101 is an equidigital number, since it uses as much as digits as its factorization.
20312030022101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20312030022101 its reverse (10122003021302), we get a palindrome (30434033043403).
The spelling of 20312030022101 in words is "twenty trillion, three hundred twelve billion, thirty million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •