Base | Representation |
---|---|
bin | 11001000010100… |
… | …110101101100101 |
3 | 1002021111222001010 |
4 | 121002212231211 |
5 | 1330022111003 |
6 | 105404252433 |
7 | 13260621660 |
oct | 3102465545 |
9 | 1067458033 |
10 | 420113253 |
11 | 1a616333a |
12 | b8841119 |
13 | 69064431 |
14 | 3db1c6d7 |
15 | 26d38003 |
hex | 190a6b65 |
420113253 has 8 divisors (see below), whose sum is σ = 640172608. Its totient is φ = 240064704.
The previous prime is 420113233. The next prime is 420113263. The reversal of 420113253 is 352311024.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 420113253 - 28 = 420112997 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: 20005393 = 420113253 / (4 + 2 + 0 + 1 + 1 + 3 + 2 + 5 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420113203) 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, 10002676 + ... + 10002717.
It is an arithmetic number, because the mean of its divisors is an integer number (80021576).
Almost surely, 2420113253 is an apocalyptic number.
It is an amenable number.
420113253 is a deficient number, since it is larger than the sum of its proper divisors (220059355).
420113253 is a wasteful number, since it uses less digits than its factorization.
420113253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20005403.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 420113253 is about 20496.6644359515. The cubic root of 420113253 is about 748.9545451538.
Adding to 420113253 its reverse (352311024), we get a palindrome (772424277).
The spelling of 420113253 in words is "four hundred twenty million, one hundred thirteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •