Base | Representation |
---|---|
bin | 111100101011100100… |
… | …1100001001111000110 |
3 | 110110100121101101122000 |
4 | 1321113021201033012 |
5 | 4113334122211402 |
6 | 135510351450130 |
7 | 12262142230014 |
oct | 1712711411706 |
9 | 413317341560 |
10 | 130311132102 |
11 | 502a02672a8 |
12 | 21308b26946 |
13 | c39949c578 |
14 | 64429398b4 |
15 | 35ca320c1c |
hex | 1e572613c6 |
130311132102 has 16 divisors (see below), whose sum is σ = 289580293680. Its totient is φ = 43437044016.
The previous prime is 130311132097. The next prime is 130311132181. The reversal of 130311132102 is 201231113031.
130311132102 is a `hidden beast` number, since 1 + 30 + 311 + 1 + 321 + 0 + 2 = 666.
It is a super-2 number, since 2×1303111321022 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1206584503 + ... + 1206584610.
It is an arithmetic number, because the mean of its divisors is an integer number (18098768355).
Almost surely, 2130311132102 is an apocalyptic number.
130311132102 is an abundant number, since it is smaller than the sum of its proper divisors (159269161578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130311132102 is a wasteful number, since it uses less digits than its factorization.
130311132102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2413169124 (or 2413169118 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 130311132102 its reverse (201231113031), we get a palindrome (331542245133).
The spelling of 130311132102 in words is "one hundred thirty billion, three hundred eleven million, one hundred thirty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •