Base | Representation |
---|---|
bin | 1011000000111010100000… |
… | …0011100001001101111001 |
3 | 1120212201212212202210002110 |
4 | 2300032220003201031321 |
5 | 3041403430032132301 |
6 | 41431224310122533 |
7 | 2356641216060030 |
oct | 260165003411571 |
9 | 46781785683073 |
10 | 12110332302201 |
11 | 3949a65961531 |
12 | 1437091950449 |
13 | 69accb9b73c3 |
14 | 2dc200d83717 |
15 | 16003e2a80d6 |
hex | b03a80e1379 |
12110332302201 has 16 divisors (see below), whose sum is σ = 18756361662848. Its totient is φ = 6806744150400.
The previous prime is 12110332302193. The next prime is 12110332302221. The reversal of 12110332302201 is 10220323301121.
It is not a de Polignac number, because 12110332302201 - 23 = 12110332302193 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (12110332302221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4726904380 + ... + 4726906941.
It is an arithmetic number, because the mean of its divisors is an integer number (1172272603928).
Almost surely, 212110332302201 is an apocalyptic number.
It is an amenable number.
12110332302201 is a deficient number, since it is larger than the sum of its proper divisors (6646029360647).
12110332302201 is an equidigital number, since it uses as much as digits as its factorization.
12110332302201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9453811392.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 12110332302201 its reverse (10220323301121), we get a palindrome (22330655603322).
The spelling of 12110332302201 in words is "twelve trillion, one hundred ten billion, three hundred thirty-two million, three hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •