Base | Representation |
---|---|
bin | 1001001100000010011111… |
… | …0000101011111100000001 |
3 | 1022202210010201122020100012 |
4 | 2103000213300223330001 |
5 | 2311004234104420442 |
6 | 33252554202434305 |
7 | 2061606431320322 |
oct | 223004760537401 |
9 | 38683121566305 |
10 | 10102430154497 |
11 | 32454644a816a |
12 | 1171b03502995 |
13 | 583869280cb5 |
14 | 26cd62c1c449 |
15 | 127bc26ad582 |
hex | 93027c2bf01 |
10102430154497 has 2 divisors, whose sum is σ = 10102430154498. Its totient is φ = 10102430154496.
The previous prime is 10102430154367. The next prime is 10102430154511. The reversal of 10102430154497 is 79445103420101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5215518630001 + 4886911524496 = 2283751^2 + 2210636^2 .
It is a cyclic number.
It is not a de Polignac number, because 10102430154497 - 28 = 10102430154241 is a prime.
It is not a weakly prime, because it can be changed into another prime (10102430154097) 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, 5051215077248 + 5051215077249.
It is an arithmetic number, because the mean of its divisors is an integer number (5051215077249).
Almost surely, 210102430154497 is an apocalyptic number.
It is an amenable number.
10102430154497 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102430154497 is an equidigital number, since it uses as much as digits as its factorization.
10102430154497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120960, while the sum is 41.
Adding to 10102430154497 its reverse (79445103420101), we get a palindrome (89547533574598).
The spelling of 10102430154497 in words is "ten trillion, one hundred two billion, four hundred thirty million, one hundred fifty-four thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •