Base | Representation |
---|---|
bin | 1011000111010110110110… |
… | …1111000111000001101101 |
3 | 1121021022121002220000120020 |
4 | 2301311231233013001231 |
5 | 3100212123343220323 |
6 | 41554132132312353 |
7 | 2400640225504254 |
oct | 261655557070155 |
9 | 47238532800506 |
10 | 12221023023213 |
11 | 39919a7993554 |
12 | 1454623a726b9 |
13 | 6a858c325064 |
14 | 303701ba779b |
15 | 162d6bd3dae3 |
hex | b1d6dbc706d |
12221023023213 has 4 divisors (see below), whose sum is σ = 16294697364288. Its totient is φ = 8147348682140.
The previous prime is 12221023023191. The next prime is 12221023023227. The reversal of 12221023023213 is 31232032012221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12221023023213 - 228 = 12220754587757 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12221023023263) 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, 2036837170533 + ... + 2036837170538.
It is an arithmetic number, because the mean of its divisors is an integer number (4073674341072).
Almost surely, 212221023023213 is an apocalyptic number.
It is an amenable number.
12221023023213 is a deficient number, since it is larger than the sum of its proper divisors (4073674341075).
12221023023213 is an equidigital number, since it uses as much as digits as its factorization.
12221023023213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4073674341074.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 12221023023213 its reverse (31232032012221), we get a palindrome (43453055035434).
The spelling of 12221023023213 in words is "twelve trillion, two hundred twenty-one billion, twenty-three million, twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.978 sec. • engine limits •