Base | Representation |
---|---|
bin | 1100010000110001100… |
… | …01001011100000110001 |
3 | 1111021111200022111020222 |
4 | 12020120301023200301 |
5 | 23400332004343101 |
6 | 521315223542425 |
7 | 42303521542514 |
oct | 6103061134061 |
9 | 1437450274228 |
10 | 421322340401 |
11 | 152755528326 |
12 | 697a3bbaa15 |
13 | 30965c73701 |
14 | 1656bd42d7b |
15 | ae5d7b901b |
hex | 6218c4b831 |
421322340401 has 4 divisors (see below), whose sum is σ = 422159959872. Its totient is φ = 420484720932.
The previous prime is 421322340367. The next prime is 421322340419. The reversal of 421322340401 is 104043223124.
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 a de Polignac number, because none of the positive numbers 2k-421322340401 is a prime.
It is a super-2 number, since 2×4213223404012 (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 (421322340001) 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, 418808981 + ... + 418809986.
It is an arithmetic number, because the mean of its divisors is an integer number (105539989968).
Almost surely, 2421322340401 is an apocalyptic number.
It is an amenable number.
421322340401 is a deficient number, since it is larger than the sum of its proper divisors (837619471).
421322340401 is an equidigital number, since it uses as much as digits as its factorization.
421322340401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 837619470.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 421322340401 its reverse (104043223124), we get a palindrome (525365563525).
The spelling of 421322340401 in words is "four hundred twenty-one billion, three hundred twenty-two million, three hundred forty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •