Base | Representation |
---|---|
bin | 100100011111011011111… |
… | …0010100001111011000000 |
3 | 122202110101121011111220121 |
4 | 1020332313302201323000 |
5 | 1124132323414423404 |
6 | 14400000213350024 |
7 | 1025226031154512 |
oct | 110766762417300 |
9 | 18673347144817 |
10 | 5015310311104 |
11 | 1663a87a15935 |
12 | 690001338314 |
13 | 2a4c31cab452 |
14 | 134a56ca5bb2 |
15 | 8a6d68cee54 |
hex | 48fb7ca1ec0 |
5015310311104 has 112 divisors (see below), whose sum is σ = 10722559297536. Its totient is φ = 2320689254400.
The previous prime is 5015310311093. The next prime is 5015310311107. The reversal of 5015310311104 is 4011130135105.
It is a super-2 number, since 2×50153103111042 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5015310311107) 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, 233031864 + ... + 233053384.
Almost surely, 25015310311104 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5015310311104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5361279648768).
5015310311104 is an abundant number, since it is smaller than the sum of its proper divisors (5707248986432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5015310311104 is a wasteful number, since it uses less digits than its factorization.
5015310311104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26694 (or 26684 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 25.
Adding to 5015310311104 its reverse (4011130135105), we get a palindrome (9026440446209).
The spelling of 5015310311104 in words is "five trillion, fifteen billion, three hundred ten million, three hundred eleven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •