Base | Representation |
---|---|
bin | 10010101011000000… |
… | …00100000111001001 |
3 | 221212121200110022001 |
4 | 21111200010013021 |
5 | 131012221402101 |
6 | 4334413431001 |
7 | 503262010615 |
oct | 112540040711 |
9 | 27777613261 |
10 | 10024403401 |
11 | 4284572711 |
12 | 1b3919b461 |
13 | c39a82c5c |
14 | 6b14b6345 |
15 | 3da0cd901 |
hex | 2558041c9 |
10024403401 has 4 divisors (see below), whose sum is σ = 10552003600. Its totient is φ = 9496803204.
The previous prime is 10024403383. The next prime is 10024403429. The reversal of 10024403401 is 10430442001.
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 10024403401 - 29 = 10024402889 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19), and also a Moran number because the ratio is a prime number: 527600179 = 10024403401 / (1 + 0 + 0 + 2 + 4 + 4 + 0 + 3 + 4 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10024403491) 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, 263800071 + ... + 263800108.
It is an arithmetic number, because the mean of its divisors is an integer number (2638000900).
Almost surely, 210024403401 is an apocalyptic number.
It is an amenable number.
10024403401 is a deficient number, since it is larger than the sum of its proper divisors (527600199).
10024403401 is an equidigital number, since it uses as much as digits as its factorization.
10024403401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 527600198.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 10024403401 its reverse (10430442001), we get a palindrome (20454845402).
The spelling of 10024403401 in words is "ten billion, twenty-four million, four hundred three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •