Base | Representation |
---|---|
bin | 1011001011111110001100… |
… | …1000110101010111011111 |
3 | 1121112220020012111000121011 |
4 | 2302333203020311113133 |
5 | 3103012004320042343 |
6 | 42054403014320051 |
7 | 2406444644602456 |
oct | 262774310652737 |
9 | 47486205430534 |
10 | 12300302112223 |
11 | 3a1258a968524 |
12 | 1467a6a359027 |
13 | 6b2bb4ca8808 |
14 | 3074a2cc3b9d |
15 | 164e5bda929d |
hex | b2fe32355df |
12300302112223 has 4 divisors (see below), whose sum is σ = 12456002139040. Its totient is φ = 12144602085408.
The previous prime is 12300302112187. The next prime is 12300302112337. The reversal of 12300302112223 is 32221120300321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12300302112223 - 221 = 12300300015071 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12300302112194 and 12300302112203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12300302142223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77850013290 + ... + 77850013447.
It is an arithmetic number, because the mean of its divisors is an integer number (3114000534760).
Almost surely, 212300302112223 is an apocalyptic number.
12300302112223 is a deficient number, since it is larger than the sum of its proper divisors (155700026817).
12300302112223 is an equidigital number, since it uses as much as digits as its factorization.
12300302112223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155700026816.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 12300302112223 its reverse (32221120300321), we get a palindrome (44521422412544).
The spelling of 12300302112223 in words is "twelve trillion, three hundred billion, three hundred two million, one hundred twelve thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.410 sec. • engine limits •