Base | Representation |
---|---|
bin | 1010111010100011100111… |
… | …1010101110101111010010 |
3 | 1120111021222000100022102022 |
4 | 2232220321322232233102 |
5 | 3033111233220302010 |
6 | 41305122312051442 |
7 | 2346023462416166 |
oct | 256507172565722 |
9 | 46437860308368 |
10 | 12001110322130 |
11 | 39077079aa2a6 |
12 | 1419a8b693b82 |
13 | 690913745927 |
14 | 2d6bdd246ca6 |
15 | 15c29a644d55 |
hex | aea39eaebd2 |
12001110322130 has 32 divisors (see below), whose sum is σ = 22544649157248. Its totient is φ = 4591029801600.
The previous prime is 12001110322127. The next prime is 12001110322133. The reversal of 12001110322130 is 3122301110021.
It is an interprime number because it is at equal distance from previous prime (12001110322127) and next prime (12001110322133).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12001110322099 and 12001110322108.
It is not an unprimeable number, because it can be changed into a prime (12001110322133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2459051 + ... + 5481710.
It is an arithmetic number, because the mean of its divisors is an integer number (704520286164).
Almost surely, 212001110322130 is an apocalyptic number.
12001110322130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12001110322130 is a deficient number, since it is larger than the sum of its proper divisors (10543538835118).
12001110322130 is a wasteful number, since it uses less digits than its factorization.
12001110322130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7947362.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 12001110322130 its reverse (3122301110021), we get a palindrome (15123411432151).
The spelling of 12001110322130 in words is "twelve trillion, one billion, one hundred ten million, three hundred twenty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •