Base | Representation |
---|---|
bin | 1001001111101111011111… |
… | …10010001011110001011101 |
3 | 2122222201201020002002210212 |
4 | 10213313233302023301131 |
5 | 10131110121344401023 |
6 | 111124234512342205 |
7 | 4165642320002204 |
oct | 447675762136135 |
9 | 78881636062725 |
10 | 20332103122013 |
11 | 6529884179031 |
12 | 23445b8244965 |
13 | b46403119617 |
14 | 504116c6823b |
15 | 253d40b00e78 |
hex | 127defc8bc5d |
20332103122013 has 2 divisors, whose sum is σ = 20332103122014. Its totient is φ = 20332103122012.
The previous prime is 20332103121961. The next prime is 20332103122063. The reversal of 20332103122013 is 31022130123302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19930626283129 + 401476838884 = 4464373^2 + 633622^2 .
It is a cyclic number.
It is not a de Polignac number, because 20332103122013 - 218 = 20332102859869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20332103122013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20332103122063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10166051561006 + 10166051561007.
It is an arithmetic number, because the mean of its divisors is an integer number (10166051561007).
Almost surely, 220332103122013 is an apocalyptic number.
It is an amenable number.
20332103122013 is a deficient number, since it is larger than the sum of its proper divisors (1).
20332103122013 is an equidigital number, since it uses as much as digits as its factorization.
20332103122013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 20332103122013 its reverse (31022130123302), we get a palindrome (51354233245315).
The spelling of 20332103122013 in words is "twenty trillion, three hundred thirty-two billion, one hundred three million, one hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •