Base | Representation |
---|---|
bin | 100110010110011111101… |
… | …1000000001101100000000 |
3 | 200122220100020002201102000 |
4 | 1030230333120001230000 |
5 | 1142324440430311133 |
6 | 15113243012424000 |
7 | 1052546666622300 |
oct | 114547730015400 |
9 | 20586306081360 |
10 | 5270988135168 |
11 | 175246042a368 |
12 | 711677318000 |
13 | 2c308a472642 |
14 | 14318d7bd600 |
15 | 9219cde2413 |
hex | 4cb3f601b00 |
5270988135168 has 1728 divisors, whose sum is σ = 19470444134400. Its totient is φ = 1400217477120.
The previous prime is 5270988135157. The next prime is 5270988135247. The reversal of 5270988135168 is 8615318890725.
5270988135168 is a `hidden beast` number, since 5 + 27 + 0 + 9 + 88 + 13 + 516 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (1728).
It is a Harshad number since it is a multiple of its sum of digits (63).
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 41503843521 + ... + 41503843647.
Almost surely, 25270988135168 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 5270988135168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9735222067200).
5270988135168 is an abundant number, since it is smaller than the sum of its proper divisors (14199455999232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5270988135168 is a wasteful number, since it uses less digits than its factorization.
5270988135168 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 323 (or 296 counting only the distinct ones).
The product of its (nonzero) digits is 29030400, while the sum is 63.
The spelling of 5270988135168 in words is "five trillion, two hundred seventy billion, nine hundred eighty-eight million, one hundred thirty-five thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •