Base | Representation |
---|---|
bin | 101110100010111011… |
… | …0101001111011110101 |
3 | 100120000010020020101222 |
4 | 1131011312221323311 |
5 | 3114202242001003 |
6 | 113530320200125 |
7 | 10136002465124 |
oct | 1350566517365 |
9 | 316003206358 |
10 | 99956203253 |
11 | 39433741a45 |
12 | 17457169045 |
13 | 956c7169ca |
14 | 4ba32ddabb |
15 | 2900487c38 |
hex | 1745da9ef5 |
99956203253 has 2 divisors, whose sum is σ = 99956203254. Its totient is φ = 99956203252.
The previous prime is 99956203211. The next prime is 99956203267. The reversal of 99956203253 is 35230265999.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99235710289 + 720492964 = 315017^2 + 26842^2 .
It is an emirp because it is prime and its reverse (35230265999) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-99956203253 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 99956203195 and 99956203204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (99956203273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 49978101626 + 49978101627.
It is an arithmetic number, because the mean of its divisors is an integer number (49978101627).
Almost surely, 299956203253 is an apocalyptic number.
It is an amenable number.
99956203253 is a deficient number, since it is larger than the sum of its proper divisors (1).
99956203253 is an equidigital number, since it uses as much as digits as its factorization.
99956203253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3936600, while the sum is 53.
The spelling of 99956203253 in words is "ninety-nine billion, nine hundred fifty-six million, two hundred three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •