Base | Representation |
---|---|
bin | 100101001011110110110… |
… | …0001100110001110101000 |
3 | 200002120121112210211000020 |
4 | 1022113231201212032220 |
5 | 1132213203441404342 |
6 | 14511453525440440 |
7 | 1035143636530341 |
oct | 112275541461650 |
9 | 20076545724006 |
10 | 5110701122472 |
11 | 16a0488603330 |
12 | 6a65a3570120 |
13 | 2b0c2490442a |
14 | 139505b170c8 |
15 | 8ce1b15e0ec |
hex | 4a5ed8663a8 |
5110701122472 has 64 divisors (see below), whose sum is σ = 13938717988800. Its totient is φ = 1548648176640.
The previous prime is 5110701122453. The next prime is 5110701122473. The reversal of 5110701122472 is 2742211070115.
It is a super-2 number, since 2×51107011224722 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (5110701122473) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8508438 + ... + 9089274.
It is an arithmetic number, because the mean of its divisors is an integer number (217792468575).
Almost surely, 25110701122472 is an apocalyptic number.
It is an amenable number.
5110701122472 is an abundant number, since it is smaller than the sum of its proper divisors (8828016866328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5110701122472 is a wasteful number, since it uses less digits than its factorization.
5110701122472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614186 (or 614182 counting only the distinct ones).
The product of its (nonzero) digits is 7840, while the sum is 33.
Adding to 5110701122472 its reverse (2742211070115), we get a palindrome (7852912192587).
The spelling of 5110701122472 in words is "five trillion, one hundred ten billion, seven hundred one million, one hundred twenty-two thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •