Base | Representation |
---|---|
bin | 1001001001000010111010… |
… | …01010100111111001111111 |
3 | 2122011201210122022000000001 |
4 | 10210201131022213321333 |
5 | 10113322404030330023 |
6 | 110430422542415131 |
7 | 4143215355556345 |
oct | 444413512477177 |
9 | 78151718260001 |
10 | 20102010011263 |
11 | 645023a658374 |
12 | 2307aa25914a7 |
13 | b2a7c436454b |
14 | 4d6d2a221995 |
15 | 24cd757ae6ad |
hex | 12485d2a7e7f |
20102010011263 has 2 divisors, whose sum is σ = 20102010011264. Its totient is φ = 20102010011262.
The previous prime is 20102010011219. The next prime is 20102010011269. The reversal of 20102010011263 is 36211001020102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20102010011263 - 213 = 20102010003071 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20102010011263.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20102010011269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10051005005631 + 10051005005632.
It is an arithmetic number, because the mean of its divisors is an integer number (10051005005632).
Almost surely, 220102010011263 is an apocalyptic number.
20102010011263 is a deficient number, since it is larger than the sum of its proper divisors (1).
20102010011263 is an equidigital number, since it uses as much as digits as its factorization.
20102010011263 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 20102010011263 its reverse (36211001020102), we get a palindrome (56313011031365).
The spelling of 20102010011263 in words is "twenty trillion, one hundred two billion, ten million, eleven thousand, two hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •