Base | Representation |
---|---|
bin | 1100010000011000011… |
… | …11010010101101100001 |
3 | 1111020222000202201100102 |
4 | 12020030033102231201 |
5 | 23344414201133101 |
6 | 521242314232145 |
7 | 42265360022414 |
oct | 6101417225541 |
9 | 1436860681312 |
10 | 421112130401 |
11 | 152657901456 |
12 | 69745725655 |
13 | 309315530b1 |
14 | 1654c063b7b |
15 | ae4a0e486b |
hex | 620c3d2b61 |
421112130401 has 4 divisors (see below), whose sum is σ = 434696392704. Its totient is φ = 407527868100.
The previous prime is 421112130391. The next prime is 421112130407. The reversal of 421112130401 is 104031211124.
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 421112130401 - 26 = 421112130337 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (421112130407) 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, 6792131105 + ... + 6792131166.
It is an arithmetic number, because the mean of its divisors is an integer number (108674098176).
Almost surely, 2421112130401 is an apocalyptic number.
It is an amenable number.
421112130401 is a deficient number, since it is larger than the sum of its proper divisors (13584262303).
421112130401 is a wasteful number, since it uses less digits than its factorization.
421112130401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13584262302.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 421112130401 its reverse (104031211124), we get a palindrome (525143341525).
The spelling of 421112130401 in words is "four hundred twenty-one billion, one hundred twelve million, one hundred thirty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •