Base | Representation |
---|---|
bin | 1011000010001011010101… |
… | …1010101111011101010010 |
3 | 1120221210220010022121111112 |
4 | 2300202311122233131102 |
5 | 3042232400010031010 |
6 | 41445213411413322 |
7 | 2361340021550105 |
oct | 260426532573522 |
9 | 46853803277445 |
10 | 12132031330130 |
11 | 395819044a368 |
12 | 143b3288b4242 |
13 | 6a007938acba |
14 | 2dd29cb7a73c |
15 | 1608ae284a05 |
hex | b08b56af752 |
12132031330130 has 8 divisors (see below), whose sum is σ = 21837656394252. Its totient is φ = 4852812532048.
The previous prime is 12132031330103. The next prime is 12132031330151. The reversal of 12132031330130 is 3103313023121.
It can be written as a sum of positive squares in 2 ways, for example, as 11562264510889 + 569766819241 = 3400333^2 + 754829^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 12132031330096 and 12132031330105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 606601566497 + ... + 606601566516.
Almost surely, 212132031330130 is an apocalyptic number.
12132031330130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12132031330130 is a deficient number, since it is larger than the sum of its proper divisors (9705625064122).
12132031330130 is a wasteful number, since it uses less digits than its factorization.
12132031330130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1213203133020.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 12132031330130 its reverse (3103313023121), we get a palindrome (15235344353251).
The spelling of 12132031330130 in words is "twelve trillion, one hundred thirty-two billion, thirty-one million, three hundred thirty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •