Base | Representation |
---|---|
bin | 1110110000010001100… |
… | …0111000101100110111 |
3 | 220020021020010200002012 |
4 | 3230010120320230313 |
5 | 13123110013444111 |
6 | 312240125234435 |
7 | 24212250266126 |
oct | 3540430705467 |
9 | 806236120065 |
10 | 253476703031 |
11 | 98553a99742 |
12 | 41160a02a1b |
13 | 1ab9745c516 |
14 | c3a8467abd |
15 | 68d817348b |
hex | 3b04638b37 |
253476703031 has 2 divisors, whose sum is σ = 253476703032. Its totient is φ = 253476703030.
The previous prime is 253476702803. The next prime is 253476703069. The reversal of 253476703031 is 130307674352.
253476703031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 253476703031 - 230 = 252402961207 is a prime.
It is a super-2 number, since 2×2534767030312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 253476703031.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (253476703631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 126738351515 + 126738351516.
It is an arithmetic number, because the mean of its divisors is an integer number (126738351516).
Almost surely, 2253476703031 is an apocalyptic number.
253476703031 is a deficient number, since it is larger than the sum of its proper divisors (1).
253476703031 is an equidigital number, since it uses as much as digits as its factorization.
253476703031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 317520, while the sum is 41.
The spelling of 253476703031 in words is "two hundred fifty-three billion, four hundred seventy-six million, seven hundred three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •