Base | Representation |
---|---|
bin | 1001000110101010010110… |
… | …00001010110011111010001 |
3 | 2121212220101021102212211021 |
4 | 10203111023001112133101 |
5 | 10111002131402241423 |
6 | 110325035120515441 |
7 | 4134255525346552 |
oct | 443251301263721 |
9 | 77786337385737 |
10 | 20020101212113 |
11 | 6419528236232 |
12 | 22b404347bb81 |
13 | b22b6c937aa2 |
14 | 4d2d99b6c329 |
15 | 24ab7e94595d |
hex | 12354b0567d1 |
20020101212113 has 2 divisors, whose sum is σ = 20020101212114. Its totient is φ = 20020101212112.
The previous prime is 20020101212047. The next prime is 20020101212171. The reversal of 20020101212113 is 31121210102002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10673733316624 + 9346367895489 = 3267068^2 + 3057183^2 .
It is a cyclic number.
It is not a de Polignac number, because 20020101212113 - 217 = 20020101081041 is a prime.
It is not a weakly prime, because it can be changed into another prime (20020101222113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010050606056 + 10010050606057.
It is an arithmetic number, because the mean of its divisors is an integer number (10010050606057).
Almost surely, 220020101212113 is an apocalyptic number.
It is an amenable number.
20020101212113 is a deficient number, since it is larger than the sum of its proper divisors (1).
20020101212113 is an equidigital number, since it uses as much as digits as its factorization.
20020101212113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 20020101212113 its reverse (31121210102002), we get a palindrome (51141311314115).
It can be divided in two parts, 2002010 and 1212113, that added together give a palindrome (3214123).
The spelling of 20020101212113 in words is "twenty trillion, twenty billion, one hundred one million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •