Base | Representation |
---|---|
bin | 100000011101110000… |
… | …111110001000001111 |
3 | 10022222101120112002012 |
4 | 200131300332020033 |
5 | 1032342413140043 |
6 | 24003011451435 |
7 | 2342561405645 |
oct | 403560761017 |
9 | 108871515065 |
10 | 34859115023 |
11 | 13869075077 |
12 | 690a2b6b7b |
13 | 3396c968a5 |
14 | 1989915195 |
15 | d90501a18 |
hex | 81dc3e20f |
34859115023 has 2 divisors, whose sum is σ = 34859115024. Its totient is φ = 34859115022.
The previous prime is 34859115017. The next prime is 34859115029. The reversal of 34859115023 is 32051195843.
It is a balanced prime because it is at equal distance from previous prime (34859115017) and next prime (34859115029).
It is a cyclic number.
It is not a de Polignac number, because 34859115023 - 28 = 34859114767 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (34859115029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17429557511 + 17429557512.
It is an arithmetic number, because the mean of its divisors is an integer number (17429557512).
Almost surely, 234859115023 is an apocalyptic number.
34859115023 is a deficient number, since it is larger than the sum of its proper divisors (1).
34859115023 is an equidigital number, since it uses as much as digits as its factorization.
34859115023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 41.
The spelling of 34859115023 in words is "thirty-four billion, eight hundred fifty-nine million, one hundred fifteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •