Base | Representation |
---|---|
bin | 10111001111111100101110… |
… | …011000111101010100010111 |
3 | 111102001002212111201010111102 |
4 | 113033330232120331110113 |
5 | 101400240140031213143 |
6 | 1001245253551500315 |
7 | 30352252463364146 |
oct | 2717745630752427 |
9 | 442032774633442 |
10 | 102251064710423 |
11 | 2a642484392982 |
12 | b574b3682769b |
13 | 4509307212365 |
14 | 1b36d9966775d |
15 | bc4bb8ccb0b8 |
hex | 5cff2e63d517 |
102251064710423 has 16 divisors (see below), whose sum is σ = 104068116191520. Its totient is φ = 100436843760000.
The previous prime is 102251064710309. The next prime is 102251064710467. The reversal of 102251064710423 is 324017460152201.
It is a cyclic number.
It is not a de Polignac number, because 102251064710423 - 212 = 102251064706327 is a prime.
It is a super-2 number, since 2×1022510647104232 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102251064710023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 388802273 + ... + 389065173.
It is an arithmetic number, because the mean of its divisors is an integer number (6504257261970).
Almost surely, 2102251064710423 is an apocalyptic number.
102251064710423 is a deficient number, since it is larger than the sum of its proper divisors (1817051481097).
102251064710423 is a wasteful number, since it uses less digits than its factorization.
102251064710423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268258.
The product of its (nonzero) digits is 80640, while the sum is 38.
The spelling of 102251064710423 in words is "one hundred two trillion, two hundred fifty-one billion, sixty-four million, seven hundred ten thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •