Base | Representation |
---|---|
bin | 100101100011010011111… |
… | …0010010110001100111110 |
3 | 200021101121220002021020112 |
4 | 1023012213302112030332 |
5 | 1134024333100400320 |
6 | 14550544012550022 |
7 | 1041606100153400 |
oct | 113064762261476 |
9 | 20241556067215 |
10 | 5161070715710 |
11 | 170a885963238 |
12 | 6b4300182312 |
13 | 2b58c10ca580 |
14 | 13bb23574b70 |
15 | 8e3b81acec5 |
hex | 4b1a7c9633e |
5161070715710 has 48 divisors (see below), whose sum is σ = 11637930902976. Its totient is φ = 1633393806912.
The previous prime is 5161070715701. The next prime is 5161070715791. The reversal of 5161070715710 is 175170701615.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 405101222 + ... + 405113961.
It is an arithmetic number, because the mean of its divisors is an integer number (242456893812).
Almost surely, 25161070715710 is an apocalyptic number.
5161070715710 is an abundant number, since it is smaller than the sum of its proper divisors (6476860187266).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5161070715710 is a wasteful number, since it uses less digits than its factorization.
5161070715710 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 810215217 (or 810215210 counting only the distinct ones).
The product of its (nonzero) digits is 51450, while the sum is 41.
The spelling of 5161070715710 in words is "five trillion, one hundred sixty-one billion, seventy million, seven hundred fifteen thousand, seven hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •