Base | Representation |
---|---|
bin | 11101101000001001001100… |
… | …100111110100000000111100 |
3 | 122002100202020122120002012021 |
4 | 131220021030213310000330 |
5 | 114034332000323044012 |
6 | 1141043525225245524 |
7 | 36306003053521513 |
oct | 3550111447640074 |
9 | 562322218502167 |
10 | 130302003331132 |
11 | 38577850a06896 |
12 | 127454993338a4 |
13 | 5792570456419 |
14 | 24269173c567a |
15 | 100e6c2a77007 |
hex | 76824c9f403c |
130302003331132 has 12 divisors (see below), whose sum is σ = 228876195444120. Its totient is φ = 64908804632816.
The previous prime is 130302003331117. The next prime is 130302003331139. The reversal of 130302003331132 is 231133300203031.
It is a super-2 number, since 2×1303020033311322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130302003331097 and 130302003331106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130302003331139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60549256978 + ... + 60549259129.
It is an arithmetic number, because the mean of its divisors is an integer number (19073016287010).
Almost surely, 2130302003331132 is an apocalyptic number.
It is an amenable number.
130302003331132 is a deficient number, since it is larger than the sum of its proper divisors (98574192112988).
130302003331132 is a wasteful number, since it uses less digits than its factorization.
130302003331132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 121098516380 (or 121098516378 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 130302003331132 its reverse (231133300203031), we get a palindrome (361435303534163).
The spelling of 130302003331132 in words is "one hundred thirty trillion, three hundred two billion, three million, three hundred thirty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •