Base | Representation |
---|---|
bin | 10110011001011000… |
… | …00000000101010011 |
3 | 1011000222022120102101 |
4 | 23030230000011103 |
5 | 144111122140311 |
6 | 5305044301231 |
7 | 603652331530 |
oct | 131454000523 |
9 | 34028276371 |
10 | 12024021331 |
11 | 5110279213 |
12 | 23b69a1817 |
13 | 119812542a |
14 | 820cb1d87 |
15 | 4a5917ec1 |
hex | 2ccb00153 |
12024021331 has 8 divisors (see below), whose sum is σ = 14001017184. Its totient is φ = 10111845120.
The previous prime is 12024021319. The next prime is 12024021337. The reversal of 12024021331 is 13312042021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12024021331 - 221 = 12021924179 is a prime.
It is a super-2 number, since 2×120240213312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12024021299 and 12024021308.
It is not an unprimeable number, because it can be changed into a prime (12024021337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16204510 + ... + 16205251.
It is an arithmetic number, because the mean of its divisors is an integer number (1750127148).
Almost surely, 212024021331 is an apocalyptic number.
12024021331 is a deficient number, since it is larger than the sum of its proper divisors (1976995853).
12024021331 is an equidigital number, since it uses as much as digits as its factorization.
12024021331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32409821.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 12024021331 its reverse (13312042021), we get a palindrome (25336063352).
The spelling of 12024021331 in words is "twelve billion, twenty-four million, twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •