Base | Representation |
---|---|
bin | 1011000001011110101000… |
… | …1101011001100011011101 |
3 | 1120220122220212200201220101 |
4 | 2300113222031121203131 |
5 | 3042033311210414401 |
6 | 41435511011021101 |
7 | 2360433460145200 |
oct | 260275215314335 |
9 | 46818825621811 |
10 | 12120032123101 |
11 | 395309318a541 |
12 | 1438b3a29a791 |
13 | 69bbb64433b6 |
14 | 2dc8812c7937 |
15 | 16040ab1e101 |
hex | b05ea3598dd |
12120032123101 has 12 divisors (see below), whose sum is σ = 14105098700352. Its totient is φ = 10383967304088.
The previous prime is 12120032123081. The next prime is 12120032123117. The reversal of 12120032123101 is 10132123002121.
It is not a de Polignac number, because 12120032123101 - 29 = 12120032122589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120032123201) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 55027765 + ... + 55247578.
It is an arithmetic number, because the mean of its divisors is an integer number (1175424891696).
Almost surely, 212120032123101 is an apocalyptic number.
It is an amenable number.
12120032123101 is a deficient number, since it is larger than the sum of its proper divisors (1985066577251).
12120032123101 is a wasteful number, since it uses less digits than its factorization.
12120032123101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110277600 (or 110277593 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 12120032123101 its reverse (10132123002121), we get a palindrome (22252155125222).
The spelling of 12120032123101 in words is "twelve trillion, one hundred twenty billion, thirty-two million, one hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •