Base | Representation |
---|---|
bin | 1101101100111101001111… |
… | …11000111011111100110100 |
3 | 10221200120222202010112200112 |
4 | 12312132213320323330310 |
5 | 12422140330122132012 |
6 | 144030242205002152 |
7 | 6226652232423506 |
oct | 666364770737464 |
9 | 127616882115615 |
10 | 30132012302132 |
11 | 9667a0744a5a4 |
12 | 3467951b53358 |
13 | 13a758a1a77b0 |
14 | 76257bbd3d76 |
15 | 373c09630122 |
hex | 1b67a7e3bf34 |
30132012302132 has 24 divisors (see below), whose sum is σ = 57201759470856. Its totient is φ = 13805571045888.
The previous prime is 30132012302083. The next prime is 30132012302237. The reversal of 30132012302132 is 23120321023103.
It can be written as a sum of positive squares in 4 ways, for example, as 8475982113316 + 21656030188816 = 2911354^2 + 4653604^2 .
It is a junction number, because it is equal to n+sod(n) for n = 30132012302098 and 30132012302107.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2114816873 + ... + 2114831120.
It is an arithmetic number, because the mean of its divisors is an integer number (2383406644619).
Almost surely, 230132012302132 is an apocalyptic number.
It is an amenable number.
30132012302132 is a deficient number, since it is larger than the sum of its proper divisors (27069747168724).
30132012302132 is a wasteful number, since it uses less digits than its factorization.
30132012302132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4229648147 (or 4229648145 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 30132012302132 its reverse (23120321023103), we get a palindrome (53252333325235).
The spelling of 30132012302132 in words is "thirty trillion, one hundred thirty-two billion, twelve million, three hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •