Base | Representation |
---|---|
bin | 10110100011110000… |
… | …10000011010101010 |
3 | 1011021001012122101120 |
4 | 23101320100122222 |
5 | 144300421320132 |
6 | 5321435200110 |
7 | 606060551610 |
oct | 132170203252 |
9 | 34231178346 |
10 | 12111120042 |
11 | 515545881a |
12 | 241bba6036 |
13 | 11b019c928 |
14 | 82c6a56b0 |
15 | 4ad3c002c |
hex | 2d1e106aa |
12111120042 has 128 divisors (see below), whose sum is σ = 29846859264. Its totient is φ = 3197657088.
The previous prime is 12111120017. The next prime is 12111120101. The reversal of 12111120042 is 24002111121.
12111120042 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 16522308 + ... + 16523040.
It is an arithmetic number, because the mean of its divisors is an integer number (233178588).
Almost surely, 212111120042 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12111120042, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14923429632).
12111120042 is an abundant number, since it is smaller than the sum of its proper divisors (17735739222).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12111120042 is a wasteful number, since it uses less digits than its factorization.
12111120042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1152.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12111120042 its reverse (24002111121), we get a palindrome (36113231163).
It can be divided in two parts, 1211 and 1120042, that added together give a triangular number (1121253 = T1497).
The spelling of 12111120042 in words is "twelve billion, one hundred eleven million, one hundred twenty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •