Base | Representation |
---|---|
bin | 10111000100111010100010… |
… | …111000110011100000010001 |
3 | 111022100121200102201001101112 |
4 | 113010322202320303200101 |
5 | 101300324233330120442 |
6 | 555505053033543105 |
7 | 30243420305622632 |
oct | 2704724270634021 |
9 | 438317612631345 |
10 | 101492810004497 |
11 | 2a37a94a37651a |
12 | b471ba0874a95 |
13 | 4482966a92c32 |
14 | 1b0c3c75c5889 |
15 | bb00da820082 |
hex | 5c4ea2e33811 |
101492810004497 has 2 divisors, whose sum is σ = 101492810004498. Its totient is φ = 101492810004496.
The previous prime is 101492810004413. The next prime is 101492810004541. The reversal of 101492810004497 is 794400018294101.
It is a Cunningham number, because it is equal to 100743642+1.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101492810004496 + 1 = 10074364^2 + 1^2 .
It is a cyclic number.
It is not a de Polignac number, because 101492810004497 - 226 = 101492742895633 is a prime.
It is not a weakly prime, because it can be changed into another prime (101492810004097) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50746405002248 + 50746405002249.
It is an arithmetic number, because the mean of its divisors is an integer number (50746405002249).
Almost surely, 2101492810004497 is an apocalyptic number.
It is an amenable number.
101492810004497 is a deficient number, since it is larger than the sum of its proper divisors (1).
101492810004497 is an equidigital number, since it uses as much as digits as its factorization.
101492810004497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 580608, while the sum is 50.
Adding to 101492810004497 its reverse (794400018294101), we get a palindrome (895892828298598).
The spelling of 101492810004497 in words is "one hundred one trillion, four hundred ninety-two billion, eight hundred ten million, four thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •