Base | Representation |
---|---|
bin | 1011001011111101011111… |
… | …0000101011100010011100 |
3 | 1121112212201220022020222010 |
4 | 2302333113300223202130 |
5 | 3103011111433344012 |
6 | 42054332035151220 |
7 | 2406440136255024 |
oct | 262772760534234 |
9 | 47485656266863 |
10 | 12300111231132 |
11 | 3a124a214375a |
12 | 1467a16445510 |
13 | 6b2b8459501a |
14 | 3074857d6a84 |
15 | 164e4a251c3c |
hex | b2fd7c2b89c |
12300111231132 has 12 divisors (see below), whose sum is σ = 28700259539336. Its totient is φ = 4100037077040.
The previous prime is 12300111231101. The next prime is 12300111231143. The reversal of 12300111231132 is 23113211100321.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 12300111231099 and 12300111231108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 512504634619 + ... + 512504634642.
Almost surely, 212300111231132 is an apocalyptic number.
12300111231132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12300111231132 is an abundant number, since it is smaller than the sum of its proper divisors (16400148308204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12300111231132 is a wasteful number, since it uses less digits than its factorization.
12300111231132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1025009269268 (or 1025009269266 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 12300111231132 its reverse (23113211100321), we get a palindrome (35413322331453).
The spelling of 12300111231132 in words is "twelve trillion, three hundred billion, one hundred eleven million, two hundred thirty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •