Base | Representation |
---|---|
bin | 10110111010100000… |
… | …11010101101010111 |
3 | 1011202100101111121220 |
4 | 23131100122231113 |
5 | 200143303044111 |
6 | 5352414341423 |
7 | 613566205023 |
oct | 133520325527 |
9 | 34670344556 |
10 | 12302003031 |
11 | 5243183a5a |
12 | 2473aba873 |
13 | 12108b4246 |
14 | 849b93383 |
15 | 4c0027e06 |
hex | 2dd41ab57 |
12302003031 has 8 divisors (see below), whose sum is σ = 17115830400. Its totient is φ = 7844755512.
The previous prime is 12302003011. The next prime is 12302003047. The reversal of 12302003031 is 13030020321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12302003031 - 211 = 12302000983 is a prime.
It is a super-2 number, since 2×123020030312 (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 12302003031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12302003011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 89144881 + ... + 89145018.
It is an arithmetic number, because the mean of its divisors is an integer number (2139478800).
Almost surely, 212302003031 is an apocalyptic number.
12302003031 is a deficient number, since it is larger than the sum of its proper divisors (4813827369).
12302003031 is a wasteful number, since it uses less digits than its factorization.
12302003031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178289925.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 12302003031 its reverse (13030020321), we get a palindrome (25332023352).
The spelling of 12302003031 in words is "twelve billion, three hundred two million, three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •