Base | Representation |
---|---|
bin | 101111111000000001000100… |
… | …1000000010111000001100111 |
3 | 2001020001020001222010211110201 |
4 | 1133300002021000113001213 |
5 | 420144023014003323421 |
6 | 4051345402010131331 |
7 | 154462400342440420 |
oct | 13760021100270147 |
9 | 2036036058124421 |
10 | 421115252011111 |
11 | 1121a8a80343389 |
12 | 3b292b59a20b47 |
13 | 150c8cc84209a8 |
14 | 75dc130834647 |
15 | 33a4292959b91 |
hex | 17f0089017067 |
421115252011111 has 4 divisors (see below), whose sum is σ = 481274573726992. Its totient is φ = 360955930295232.
The previous prime is 421115252010913. The next prime is 421115252011133. The reversal of 421115252011111 is 111110252511124.
It is a happy number.
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 421115252011111 - 213 = 421115252002919 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 421115252011111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421115252011171) 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, 30079660857930 + ... + 30079660857943.
It is an arithmetic number, because the mean of its divisors is an integer number (120318643431748).
Almost surely, 2421115252011111 is an apocalyptic number.
421115252011111 is a deficient number, since it is larger than the sum of its proper divisors (60159321715881).
421115252011111 is an equidigital number, since it uses as much as digits as its factorization.
421115252011111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60159321715880.
The product of its (nonzero) digits is 800, while the sum is 28.
The spelling of 421115252011111 in words is "four hundred twenty-one trillion, one hundred fifteen billion, two hundred fifty-two million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •