Base | Representation |
---|---|
bin | 1011000110001100110000… |
… | …1100101111000111010011 |
3 | 1121012102020221022201202110 |
4 | 2301203030030233013103 |
5 | 3044400410022331121 |
6 | 41541042332320403 |
7 | 2366334310262541 |
oct | 261431414570723 |
9 | 47172227281673 |
10 | 12201133011411 |
11 | 3984520558273 |
12 | 14507b2913103 |
13 | 6a673c67a2c6 |
14 | 302776352d91 |
15 | 1625a5a9bd76 |
hex | b18cc32f1d3 |
12201133011411 has 8 divisors (see below), whose sum is σ = 16270593561040. Its totient is φ = 8132880568032.
The previous prime is 12201133011359. The next prime is 12201133011413. The reversal of 12201133011411 is 11411033110221.
It is a happy number.
12201133011411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12201133011411 - 214 = 12201132995027 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12201133011413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 302002996 + ... + 302043393.
It is an arithmetic number, because the mean of its divisors is an integer number (2033824195130).
Almost surely, 212201133011411 is an apocalyptic number.
12201133011411 is a deficient number, since it is larger than the sum of its proper divisors (4069460549629).
12201133011411 is an equidigital number, since it uses as much as digits as its factorization.
12201133011411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 604053125.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 12201133011411 its reverse (11411033110221), we get a palindrome (23612166121632).
The spelling of 12201133011411 in words is "twelve trillion, two hundred one billion, one hundred thirty-three million, eleven thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •