Base | Representation |
---|---|
bin | 100100111000111101001… |
… | …0001011111000010011111 |
3 | 122221200211212202001221000 |
4 | 1021301322101133002133 |
5 | 1131032042340010330 |
6 | 14441102213241343 |
7 | 1032206056561242 |
oct | 111617221370237 |
9 | 18850755661830 |
10 | 5070112813215 |
11 | 168524a56189a |
12 | 69a756633253 |
13 | 2aa1569ba5a8 |
14 | 137575367259 |
15 | 8bd42bb8560 |
hex | 49c7a45f09f |
5070112813215 has 64 divisors (see below), whose sum is σ = 9026922240000. Its totient is φ = 2700046224000.
The previous prime is 5070112813151. The next prime is 5070112813217. The reversal of 5070112813215 is 5123182110705.
5070112813215 is a `hidden beast` number, since 50 + 7 + 0 + 1 + 1 + 281 + 321 + 5 = 666.
It is not a de Polignac number, because 5070112813215 - 26 = 5070112813151 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5070112813215.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5070112813217) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 362169786 + ... + 362183784.
It is an arithmetic number, because the mean of its divisors is an integer number (141045660000).
Almost surely, 25070112813215 is an apocalyptic number.
5070112813215 is a deficient number, since it is larger than the sum of its proper divisors (3956809426785).
5070112813215 is a wasteful number, since it uses less digits than its factorization.
5070112813215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17805 (or 17799 counting only the distinct ones).
The product of its (nonzero) digits is 16800, while the sum is 36.
The spelling of 5070112813215 in words is "five trillion, seventy billion, one hundred twelve million, eight hundred thirteen thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •