Base | Representation |
---|---|
bin | 1010011111011110010100… |
… | …11111001101110001111101 |
3 | 10000200122000002221120201220 |
4 | 11033233022133031301331 |
5 | 11011001233112333412 |
6 | 121022551032023553 |
7 | 4600605255510000 |
oct | 517571237156175 |
9 | 100618002846656 |
10 | 23071666527357 |
11 | 7395703306518 |
12 | 270753a531bb9 |
13 | cb48585b8036 |
14 | 59a96321b537 |
15 | 2a023117b68c |
hex | 14fbca7cdc7d |
23071666527357 has 20 divisors (see below), whose sum is σ = 35887123678080. Its totient is φ = 13183809440088.
The previous prime is 23071666527319. The next prime is 23071666527359. The reversal of 23071666527357 is 75372566617032.
It is not a de Polignac number, because 23071666527357 - 28 = 23071666527101 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 23071666527357.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23071666527359) 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 19 ways as a sum of consecutive naturals, for example, 1601524557 + ... + 1601538962.
It is an arithmetic number, because the mean of its divisors is an integer number (1794356183904).
Almost surely, 223071666527357 is an apocalyptic number.
It is an amenable number.
23071666527357 is a deficient number, since it is larger than the sum of its proper divisors (12815457150723).
23071666527357 is an frugal number, since it uses more digits than its factorization.
23071666527357 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3203063550 (or 3203063529 counting only the distinct ones).
The product of its (nonzero) digits is 66679200, while the sum is 60.
The spelling of 23071666527357 in words is "twenty-three trillion, seventy-one billion, six hundred sixty-six million, five hundred twenty-seven thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •