Base | Representation |
---|---|
bin | 1011000111111001011011… |
… | …0100000100000011100011 |
3 | 1121022012112210011002102111 |
4 | 2301332112310010003203 |
5 | 3100340124320402321 |
6 | 42002305003500151 |
7 | 2401416200524105 |
oct | 261762664040343 |
9 | 47265483132374 |
10 | 12230302122211 |
11 | 3995929782a08 |
12 | 1456393527657 |
13 | 6a940a865894 |
14 | 303d422b1575 |
15 | 16321179b5e1 |
hex | b1f96d040e3 |
12230302122211 has 4 divisors (see below), whose sum is σ = 12377655159912. Its totient is φ = 12082949084512.
The previous prime is 12230302122197. The next prime is 12230302122257. The reversal of 12230302122211 is 11222120303221.
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 12230302122211 - 27 = 12230302122083 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12230302182211) 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, 73676518726 + ... + 73676518891.
It is an arithmetic number, because the mean of its divisors is an integer number (3094413789978).
Almost surely, 212230302122211 is an apocalyptic number.
12230302122211 is a deficient number, since it is larger than the sum of its proper divisors (147353037701).
12230302122211 is an equidigital number, since it uses as much as digits as its factorization.
12230302122211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147353037700.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 12230302122211 its reverse (11222120303221), we get a palindrome (23452422425432).
It can be divided in two parts, 1223030 and 2122211, that added together give a square (3345241 = 18292).
The spelling of 12230302122211 in words is "twelve trillion, two hundred thirty billion, three hundred two million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •