Base | Representation |
---|---|
bin | 10110111010010010… |
… | …01010101010111011 |
3 | 1011202012210221100121 |
4 | 23131021022222323 |
5 | 200142311233311 |
6 | 5352305514111 |
7 | 613544100436 |
oct | 133511125273 |
9 | 34665727317 |
10 | 12300102331 |
11 | 52420a5a30 |
12 | 2473342937 |
13 | 121039a07a |
14 | 84981a81d |
15 | 4bec9eb71 |
hex | 2dd24aabb |
12300102331 has 8 divisors (see below), whose sum is σ = 13420493424. Its totient is φ = 11180077920.
The previous prime is 12300102323. The next prime is 12300102337. The reversal of 12300102331 is 13320100321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12300102331 - 23 = 12300102323 is a prime.
It is a super-2 number, since 2×123001023312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12300102337) 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, 19020 + ... + 157993.
It is an arithmetic number, because the mean of its divisors is an integer number (1677561678).
Almost surely, 212300102331 is an apocalyptic number.
12300102331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12300102331 is a deficient number, since it is larger than the sum of its proper divisors (1120391093).
12300102331 is a wasteful number, since it uses less digits than its factorization.
12300102331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183341.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 12300102331 its reverse (13320100321), we get a palindrome (25620202652).
The spelling of 12300102331 in words is "twelve billion, three hundred million, one hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •