Base | Representation |
---|---|
bin | 1011001100100011000101… |
… | …0010110111110101011011 |
3 | 1121120211210020022112111102 |
4 | 2303020301102313311123 |
5 | 3103142244021114321 |
6 | 42103121311222015 |
7 | 2410245212403614 |
oct | 263106122676533 |
9 | 47524706275442 |
10 | 12310203301211 |
11 | 3a16800923342 |
12 | 146997221790b |
13 | 6b3b0237a71a |
14 | 307b61c84c0b |
15 | 16533b249c0b |
hex | b32314b7d5b |
12310203301211 has 4 divisors (see below), whose sum is σ = 12323202460872. Its totient is φ = 12297204141552.
The previous prime is 12310203301163. The next prime is 12310203301267. The reversal of 12310203301211 is 11210330201321.
It is a happy number.
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 12310203301211 - 230 = 12309129559387 is a prime.
It is a super-2 number, since 2×123102033012112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12310203301511) 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, 6499578410 + ... + 6499580303.
It is an arithmetic number, because the mean of its divisors is an integer number (3080800615218).
Almost surely, 212310203301211 is an apocalyptic number.
12310203301211 is a deficient number, since it is larger than the sum of its proper divisors (12999159661).
12310203301211 is an equidigital number, since it uses as much as digits as its factorization.
12310203301211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12999159660.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12310203301211 its reverse (11210330201321), we get a palindrome (23520533502532).
The spelling of 12310203301211 in words is "twelve trillion, three hundred ten billion, two hundred three million, three hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •