Base | Representation |
---|---|
bin | 10110011001000010… |
… | …00000111101000000 |
3 | 1011000202220020210000 |
4 | 23030201000331000 |
5 | 144104403010222 |
6 | 5304502440000 |
7 | 603616005135 |
oct | 131441007500 |
9 | 34022806700 |
10 | 12021141312 |
11 | 5109691434 |
12 | 23b5a33000 |
13 | 119765758b |
14 | 82076258c |
15 | 4a55499ac |
hex | 2cc840f40 |
12021141312 has 420 divisors, whose sum is σ = 39064143360. Its totient is φ = 3644766720.
The previous prime is 12021141289. The next prime is 12021141313. The reversal of 12021141312 is 21314112021.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021141313) by changing a digit.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 94654593 + ... + 94654719.
Almost surely, 212021141312 is an apocalyptic number.
12021141312 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 12021141312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19532071680).
12021141312 is an abundant number, since it is smaller than the sum of its proper divisors (27043002048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12021141312 is a wasteful number, since it uses less digits than its factorization.
12021141312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 232 (or 182 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 12021141312 its reverse (21314112021), we get a palindrome (33335253333).
The spelling of 12021141312 in words is "twelve billion, twenty-one million, one hundred forty-one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •