Base | Representation |
---|---|
bin | 11001111110100110111010… |
… | …011101011100110110111011 |
3 | 112222112112101120112212120202 |
4 | 121332212322131130312323 |
5 | 104433412234122322301 |
6 | 1042555205141312415 |
7 | 33031355363311223 |
oct | 3176467235346673 |
9 | 488475346485522 |
10 | 114253553323451 |
11 | 3344a7292a3563 |
12 | 1099312ba0570b |
13 | 4b9a0aa375419 |
14 | 202dc89971083 |
15 | d31ee542866b |
hex | 67e9ba75cdbb |
114253553323451 has 2 divisors, whose sum is σ = 114253553323452. Its totient is φ = 114253553323450.
The previous prime is 114253553323409. The next prime is 114253553323463. The reversal of 114253553323451 is 154323355352411.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 114253553323451 - 242 = 109855506812347 is a prime.
It is a super-2 number, since 2×1142535533234512 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114253553323396 and 114253553323405.
It is not a weakly prime, because it can be changed into another prime (114253553320451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57126776661725 + 57126776661726.
It is an arithmetic number, because the mean of its divisors is an integer number (57126776661726).
Almost surely, 2114253553323451 is an apocalyptic number.
114253553323451 is a deficient number, since it is larger than the sum of its proper divisors (1).
114253553323451 is an equidigital number, since it uses as much as digits as its factorization.
114253553323451 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3240000, while the sum is 47.
The spelling of 114253553323451 in words is "one hundred fourteen trillion, two hundred fifty-three billion, five hundred fifty-three million, three hundred twenty-three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •