Base | Representation |
---|---|
bin | 10110011001000011… |
… | …01111010001100000 |
3 | 1011000210020220000222 |
4 | 23030201233101200 |
5 | 144104430043130 |
6 | 5304510502212 |
7 | 603620425235 |
oct | 131441572140 |
9 | 34023226028 |
10 | 12021331040 |
11 | 5109800a34 |
12 | 23b5b04968 |
13 | 11976c2a44 |
14 | 8207b178c |
15 | 4a5585ce5 |
hex | 2cc86f460 |
12021331040 has 96 divisors (see below), whose sum is σ = 30139379424. Its totient is φ = 4515389440.
The previous prime is 12021331031. The next prime is 12021331067. The reversal of 12021331040 is 4013312021.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1249127 + ... + 1258713.
It is an arithmetic number, because the mean of its divisors is an integer number (313951869).
Almost surely, 212021331040 is an apocalyptic number.
12021331040 is a gapful number since it is divisible by the number (10) 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 12021331040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15069689712).
12021331040 is an abundant number, since it is smaller than the sum of its proper divisors (18118048384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12021331040 is a wasteful number, since it uses less digits than its factorization.
12021331040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10080 (or 10072 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 12021331040 its reverse (4013312021), we get a palindrome (16034643061).
The spelling of 12021331040 in words is "twelve billion, twenty-one million, three hundred thirty-one thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.996 sec. • engine limits •