Base | Representation |
---|---|
bin | 1001001100101111100010… |
… | …0101010101111011001001 |
3 | 1022210221100112111120000021 |
4 | 2103023320211111323021 |
5 | 2311204021012202411 |
6 | 33302314210140441 |
7 | 2062515215444314 |
oct | 223137045257311 |
9 | 38727315446007 |
10 | 10114523553481 |
11 | 324a5aa951886 |
12 | 1174319581721 |
13 | 584a45887899 |
14 | 26d78cdcd97b |
15 | 12817e22ca71 |
hex | 932f8955ec9 |
10114523553481 has 2 divisors, whose sum is σ = 10114523553482. Its totient is φ = 10114523553480.
The previous prime is 10114523553413. The next prime is 10114523553493. The reversal of 10114523553481 is 18435532541101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10048525943481 + 65997610000 = 3169941^2 + 256900^2 .
It is a cyclic number.
It is not a de Polignac number, because 10114523553481 - 213 = 10114523545289 is a prime.
It is a super-2 number, since 2×101145235534812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10114523556481) 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, 5057261776740 + 5057261776741.
It is an arithmetic number, because the mean of its divisors is an integer number (5057261776741).
Almost surely, 210114523553481 is an apocalyptic number.
It is an amenable number.
10114523553481 is a deficient number, since it is larger than the sum of its proper divisors (1).
10114523553481 is an equidigital number, since it uses as much as digits as its factorization.
10114523553481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288000, while the sum is 43.
The spelling of 10114523553481 in words is "ten trillion, one hundred fourteen billion, five hundred twenty-three million, five hundred fifty-three thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •