Base | Representation |
---|---|
bin | 10110011011010100… |
… | …01011110011111110 |
3 | 1011002002222202011001 |
4 | 23031222023303332 |
5 | 144124310303202 |
6 | 5310425520514 |
7 | 604241023321 |
oct | 131552136376 |
9 | 34062882131 |
10 | 12040322302 |
11 | 51194a2398 |
12 | 240034313a |
13 | 119b611c88 |
14 | 8231167b8 |
15 | 4a7087d87 |
hex | 2cda8bcfe |
12040322302 has 8 divisors (see below), whose sum is σ = 18845721936. Its totient is φ = 5758414992.
The previous prime is 12040322293. The next prime is 12040322311. The reversal of 12040322302 is 20322304021.
12040322302 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (12040322293) and next prime (12040322311).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×120403223022 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12040322302.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 130873023 + ... + 130873114.
It is an arithmetic number, because the mean of its divisors is an integer number (2355715242).
Almost surely, 212040322302 is an apocalyptic number.
12040322302 is a deficient number, since it is larger than the sum of its proper divisors (6805399634).
12040322302 is a wasteful number, since it uses less digits than its factorization.
12040322302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261746162.
The product of its (nonzero) digits is 576, while the sum is 19.
Adding to 12040322302 its reverse (20322304021), we get a palindrome (32362626323).
The spelling of 12040322302 in words is "twelve billion, forty million, three hundred twenty-two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •