Base | Representation |
---|---|
bin | 1100001111000101001… |
… | …00110111000000001001 |
3 | 1111012011022111101011010 |
4 | 12013202210313000021 |
5 | 23342001231003001 |
6 | 521045104354133 |
7 | 42242141510430 |
oct | 6074244670011 |
9 | 1435138441133 |
10 | 420413141001 |
11 | 152329292367 |
12 | 6958b615949 |
13 | 3084c7a89b9 |
14 | 164c32b0117 |
15 | ae08a718d6 |
hex | 61e2937009 |
420413141001 has 8 divisors (see below), whose sum is σ = 640629548224. Its totient is φ = 240236080560.
The previous prime is 420413140993. The next prime is 420413141033. The reversal of 420413141001 is 100141314024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 420413141001 - 23 = 420413140993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 20019673381 = 420413141001 / (4 + 2 + 0 + 4 + 1 + 3 + 1 + 4 + 1 + 0 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (420413141041) 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, 10009836670 + ... + 10009836711.
It is an arithmetic number, because the mean of its divisors is an integer number (80078693528).
Almost surely, 2420413141001 is an apocalyptic number.
It is an amenable number.
420413141001 is a deficient number, since it is larger than the sum of its proper divisors (220216407223).
420413141001 is a wasteful number, since it uses less digits than its factorization.
420413141001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20019673391.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 420413141001 its reverse (100141314024), we get a palindrome (520554455025).
The spelling of 420413141001 in words is "four hundred twenty billion, four hundred thirteen million, one hundred forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •