Base | Representation |
---|---|
bin | 1011000110001101111000… |
… | …1010001011010100101011 |
3 | 1121012110000221022022201102 |
4 | 2301203132022023110223 |
5 | 3044402014142033121 |
6 | 41541132254512015 |
7 | 2366344626404564 |
oct | 261433612132453 |
9 | 47173027268642 |
10 | 12201434330411 |
11 | 3984665652737 |
12 | 145087780560b |
13 | 6a6789c1a581 |
14 | 3027a438b16b |
15 | 1625c226b90b |
hex | b18de28b52b |
12201434330411 has 4 divisors (see below), whose sum is σ = 12201575707392. Its totient is φ = 12201292953432.
The previous prime is 12201434330401. The next prime is 12201434330413. The reversal of 12201434330411 is 11403343410221.
12201434330411 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 is a cyclic number.
It is not a de Polignac number, because 12201434330411 - 26 = 12201434330347 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12201434330413) 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, 70558955 + ... + 70731668.
It is an arithmetic number, because the mean of its divisors is an integer number (3050393926848).
Almost surely, 212201434330411 is an apocalyptic number.
12201434330411 is a deficient number, since it is larger than the sum of its proper divisors (141376981).
12201434330411 is an equidigital number, since it uses as much as digits as its factorization.
12201434330411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141376980.
The product of its (nonzero) digits is 6912, while the sum is 29.
Adding to 12201434330411 its reverse (11403343410221), we get a palindrome (23604777740632).
The spelling of 12201434330411 in words is "twelve trillion, two hundred one billion, four hundred thirty-four million, three hundred thirty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •