Base | Representation |
---|---|
bin | 1011001100100010110100… |
… | …0111110110010000011111 |
3 | 1121120211121100121020001021 |
4 | 2303020231013312100133 |
5 | 3103142123111133203 |
6 | 42103110331025011 |
7 | 2410243402413304 |
oct | 263105507662037 |
9 | 47524540536037 |
10 | 12310133302303 |
11 | 3a16775363101 |
12 | 146995289b167 |
13 | 6b3ac0a0c555 |
14 | 307b568630ab |
15 | 16533501e5bd |
hex | b322d1f641f |
12310133302303 has 4 divisors (see below), whose sum is σ = 12596415472168. Its totient is φ = 12023851132440.
The previous prime is 12310133302301. The next prime is 12310133302309. The reversal of 12310133302303 is 30320333101321.
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 12310133302303 - 21 = 12310133302301 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 (12310133302301) 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, 143141084868 + ... + 143141084953.
It is an arithmetic number, because the mean of its divisors is an integer number (3149103868042).
Almost surely, 212310133302303 is an apocalyptic number.
12310133302303 is a deficient number, since it is larger than the sum of its proper divisors (286282169865).
12310133302303 is an equidigital number, since it uses as much as digits as its factorization.
12310133302303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286282169864.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 12310133302303 its reverse (30320333101321), we get a palindrome (42630466403624).
The spelling of 12310133302303 in words is "twelve trillion, three hundred ten billion, one hundred thirty-three million, three hundred two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •