Base | Representation |
---|---|
bin | 100001110110101101010… |
… | …1111110101100111011011 |
3 | 121110211010121211210112021 |
4 | 1003231122233311213123 |
5 | 1102213241322241022 |
6 | 13521313523355311 |
7 | 660110662016053 |
oct | 103553257654733 |
9 | 17424117753467 |
10 | 4652972071387 |
11 | 1534350482462 |
12 | 63193ab22b37 |
13 | 279a0917bc83 |
14 | 1212c292a563 |
15 | 8107b5967c7 |
hex | 43b5abf59db |
4652972071387 has 2 divisors, whose sum is σ = 4652972071388. Its totient is φ = 4652972071386.
The previous prime is 4652972071369. The next prime is 4652972071393. The reversal of 4652972071387 is 7831702792564.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 4652972071387 - 227 = 4652837853659 is a prime.
It is not a weakly prime, because it can be changed into another prime (4652972075387) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2326486035693 + 2326486035694.
It is an arithmetic number, because the mean of its divisors is an integer number (2326486035694).
It is a 1-persistent number, because it is pandigital, but 2⋅4652972071387 = 9305944142774 is not.
Almost surely, 24652972071387 is an apocalyptic number.
4652972071387 is a deficient number, since it is larger than the sum of its proper divisors (1).
4652972071387 is an equidigital number, since it uses as much as digits as its factorization.
4652972071387 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35562240, while the sum is 61.
The spelling of 4652972071387 in words is "four trillion, six hundred fifty-two billion, nine hundred seventy-two million, seventy-one thousand, three hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •