Base | Representation |
---|---|
bin | 10110100011111111… |
… | …00000110000111100 |
3 | 1011021011210021101220 |
4 | 23101333200300330 |
5 | 144301413201022 |
6 | 5321544033340 |
7 | 606112662660 |
oct | 132177406074 |
9 | 34234707356 |
10 | 12113022012 |
11 | 51565377a3 |
12 | 2420762850 |
13 | 11b06b7560 |
14 | 82ca3c8a0 |
15 | 4ad64885c |
hex | 2d1fe0c3c |
12113022012 has 96 divisors (see below), whose sum is σ = 34841436672. Its totient is φ = 3189563136.
The previous prime is 12113022007. The next prime is 12113022043. The reversal of 12113022012 is 21022031121.
It is a junction number, because it is equal to n+sod(n) for n = 12113021982 and 12113022000.
It is a congruent number.
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, 704583 + ... + 721569.
It is an arithmetic number, because the mean of its divisors is an integer number (362931632).
Almost surely, 212113022012 is an apocalyptic number.
12113022012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12113022012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17420718336).
12113022012 is an abundant number, since it is smaller than the sum of its proper divisors (22728414660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12113022012 is a wasteful number, since it uses less digits than its factorization.
12113022012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17667 (or 17665 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 12113022012 its reverse (21022031121), we get a palindrome (33135053133).
The spelling of 12113022012 in words is "twelve billion, one hundred thirteen million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •