Base | Representation |
---|---|
bin | 1100010000001011001… |
… | …00100011001111010011 |
3 | 1111020200020021020120221 |
4 | 12020011210203033103 |
5 | 23344202031400421 |
6 | 521223240413511 |
7 | 42262531121305 |
oct | 6100544431723 |
9 | 1436606236527 |
10 | 421000262611 |
11 | 1525aa744535 |
12 | 69714177297 |
13 | 30914315836 |
14 | 1653b263975 |
15 | ae40398841 |
hex | 62059233d3 |
421000262611 has 4 divisors (see below), whose sum is σ = 423583086472. Its totient is φ = 418417438752.
The previous prime is 421000262609. The next prime is 421000262677. The reversal of 421000262611 is 116262000124.
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 421000262611 - 21 = 421000262609 is a prime.
It is a super-2 number, since 2×4210002626112 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (421000202611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1291411686 + ... + 1291412011.
It is an arithmetic number, because the mean of its divisors is an integer number (105895771618).
Almost surely, 2421000262611 is an apocalyptic number.
421000262611 is a deficient number, since it is larger than the sum of its proper divisors (2582823861).
421000262611 is a wasteful number, since it uses less digits than its factorization.
421000262611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2582823860.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 421000262611 its reverse (116262000124), we get a palindrome (537262262735).
The spelling of 421000262611 in words is "four hundred twenty-one billion, two hundred sixty-two thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •