Base | Representation |
---|---|
bin | 1010111010101011001001… |
… | …1011001101010111110010 |
3 | 1120111111011220200101012001 |
4 | 2232222302123031113302 |
5 | 3033124403304232010 |
6 | 41310055053524214 |
7 | 2346124542312421 |
oct | 256526233152762 |
9 | 46444156611161 |
10 | 12003132102130 |
11 | 3908555172564 |
12 | 141a3547a366a |
13 | 690b76577660 |
14 | 2d6d519712b8 |
15 | 15c367daac3a |
hex | aeab26cd5f2 |
12003132102130 has 64 divisors (see below), whose sum is σ = 24072447218400. Its totient is φ = 4278655180800.
The previous prime is 12003132102107. The next prime is 12003132102163. The reversal of 12003132102130 is 3120123130021.
It can be written as a sum of positive squares in 16 ways, for example, as 2613301798041 + 9389830304089 = 1616571^2 + 3064283^2 .
It is a super-2 number, since 2×120031321021302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12003132102098 and 12003132102107.
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, 37165986 + ... + 37487554.
Almost surely, 212003132102130 is an apocalyptic number.
12003132102130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12003132102130 is an abundant number, since it is smaller than the sum of its proper divisors (12069315116270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12003132102130 is a wasteful number, since it uses less digits than its factorization.
12003132102130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 331519.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 12003132102130 its reverse (3120123130021), we get a palindrome (15123255232151).
The spelling of 12003132102130 in words is "twelve trillion, three billion, one hundred thirty-two million, one hundred two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •