Base | Representation |
---|---|
bin | 11101101000010110110101… |
… | …110010001001101110001111 |
3 | 122002102011001120122120002010 |
4 | 131220112311302021232033 |
5 | 114040102001023113210 |
6 | 1141054351013032303 |
7 | 36310032064034505 |
oct | 3550266562115617 |
9 | 562364046576063 |
10 | 130316652551055 |
11 | 38582a89020613 |
12 | 127482a7325693 |
13 | 5793a664051a9 |
14 | 2427506bb8675 |
15 | 100ec7db9b920 |
hex | 7685b5c89b8f |
130316652551055 has 32 divisors (see below), whose sum is σ = 209353201344000. Its totient is φ = 69220582800512.
The previous prime is 130316652551023. The next prime is 130316652551083. The reversal of 130316652551055 is 550155256613031.
It is a cyclic number.
It is not a de Polignac number, because 130316652551055 - 25 = 130316652551023 is a prime.
It is a super-2 number, since 2×1303166525510552 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130316652550995 and 130316652551013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13542924 + ... + 21072353.
It is an arithmetic number, because the mean of its divisors is an integer number (6542287542000).
Almost surely, 2130316652551055 is an apocalyptic number.
130316652551055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
130316652551055 is a deficient number, since it is larger than the sum of its proper divisors (79036548792945).
130316652551055 is a wasteful number, since it uses less digits than its factorization.
130316652551055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34616303.
The product of its (nonzero) digits is 2025000, while the sum is 48.
The spelling of 130316652551055 in words is "one hundred thirty trillion, three hundred sixteen billion, six hundred fifty-two million, five hundred fifty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •