Base | Representation |
---|---|
bin | 1011000110110010101001… |
… | …1100010111000101101010 |
3 | 1121020101111210000120120201 |
4 | 2301230222130113011222 |
5 | 3100032222322201302 |
6 | 41545443510142414 |
7 | 2400144333146614 |
oct | 261545234270552 |
9 | 47211453016521 |
10 | 12211304100202 |
11 | 398886a8a8879 |
12 | 1452771051a0a |
13 | 6a76a093b53c |
14 | 30305d0cddb4 |
15 | 16299d9a2c87 |
hex | b1b2a71716a |
12211304100202 has 4 divisors (see below), whose sum is σ = 18316956150306. Its totient is φ = 6105652050100.
The previous prime is 12211304100173. The next prime is 12211304100239. The reversal of 12211304100202 is 20200140311221.
12211304100202 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 7060451436801 + 5150852663401 = 2657151^2 + 2269549^2 .
It is a super-2 number, since 2×122113041002022 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12211304100202.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3052826025049 + ... + 3052826025052.
Almost surely, 212211304100202 is an apocalyptic number.
12211304100202 is a deficient number, since it is larger than the sum of its proper divisors (6105652050104).
12211304100202 is an equidigital number, since it uses as much as digits as its factorization.
12211304100202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6105652050103.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 12211304100202 its reverse (20200140311221), we get a palindrome (32411444411423).
The spelling of 12211304100202 in words is "twelve trillion, two hundred eleven billion, three hundred four million, one hundred thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •