Base | Representation |
---|---|
bin | 1011001100001000101010… |
… | …0011111110101011000111 |
3 | 1121120011110221221111012212 |
4 | 2303002022203332223013 |
5 | 3103033232410221203 |
6 | 42055545435134035 |
7 | 2406604363133552 |
oct | 263021243765307 |
9 | 47504427844185 |
10 | 12303111023303 |
11 | 3a137a1481a41 |
12 | 1468512ba431b |
13 | 6b3241c05a89 |
14 | 30768bd87699 |
15 | 1650737a41d8 |
hex | b308a8feac7 |
12303111023303 has 4 divisors (see below), whose sum is σ = 12535245193608. Its totient is φ = 12070976853000.
The previous prime is 12303111023293. The next prime is 12303111023321. The reversal of 12303111023303 is 30332011130321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12303111023303 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12303111023383) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 116067085073 + ... + 116067085178.
It is an arithmetic number, because the mean of its divisors is an integer number (3133811298402).
Almost surely, 212303111023303 is an apocalyptic number.
12303111023303 is a deficient number, since it is larger than the sum of its proper divisors (232134170305).
12303111023303 is an equidigital number, since it uses as much as digits as its factorization.
12303111023303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232134170304.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 12303111023303 its reverse (30332011130321), we get a palindrome (42635122153624).
The spelling of 12303111023303 in words is "twelve trillion, three hundred three billion, one hundred eleven million, twenty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •