Base | Representation |
---|---|
bin | 1011010010100010000110… |
… | …1110000100100111011101 |
3 | 1121221200011210100112102002 |
4 | 2310220201232010213131 |
5 | 3111333331412223401 |
6 | 42222244020012045 |
7 | 2420545144253060 |
oct | 264504156044735 |
9 | 47850153315362 |
10 | 12413021211101 |
11 | 3a56372959895 |
12 | 1485887831025 |
13 | 6c0709918364 |
14 | 30cb1726c8d7 |
15 | 167d57a5aa6b |
hex | b4a21b849dd |
12413021211101 has 4 divisors (see below), whose sum is σ = 14186309955552. Its totient is φ = 10639732466652.
The previous prime is 12413021211047. The next prime is 12413021211179. The reversal of 12413021211101 is 10111212031421.
It is a happy number.
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 12413021211101 - 26 = 12413021211037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12413021211401) 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, 886644372215 + ... + 886644372228.
It is an arithmetic number, because the mean of its divisors is an integer number (3546577488888).
Almost surely, 212413021211101 is an apocalyptic number.
It is an amenable number.
12413021211101 is a deficient number, since it is larger than the sum of its proper divisors (1773288744451).
12413021211101 is an equidigital number, since it uses as much as digits as its factorization.
12413021211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1773288744450.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 12413021211101 its reverse (10111212031421), we get a palindrome (22524233242522).
The spelling of 12413021211101 in words is "twelve trillion, four hundred thirteen billion, twenty-one million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •