Base | Representation |
---|---|
bin | 10011010111110100… |
… | …11101100001111101 |
3 | 222211211020011212022 |
4 | 21223322131201331 |
5 | 132300002001023 |
6 | 4440005045525 |
7 | 515506062032 |
oct | 115372354175 |
9 | 28754204768 |
10 | 10400422013 |
11 | 4457848aa3 |
12 | 20230b68a5 |
13 | c99948b87 |
14 | 7093d7389 |
15 | 40d1067c8 |
hex | 26be9d87d |
10400422013 has 4 divisors (see below), whose sum is σ = 10501397088. Its totient is φ = 10299446940.
The previous prime is 10400421947. The next prime is 10400422057. The reversal of 10400422013 is 31022400401.
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, and also an emirpimes, since its reverse is a distinct semiprime: 31022400401 = 61 ⋅508563941.
It is a cyclic number.
It is not a de Polignac number, because 10400422013 - 212 = 10400417917 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10400421982 and 10400422000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10400422073) 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, 50487383 + ... + 50487588.
It is an arithmetic number, because the mean of its divisors is an integer number (2625349272).
Almost surely, 210400422013 is an apocalyptic number.
It is an amenable number.
10400422013 is a deficient number, since it is larger than the sum of its proper divisors (100975075).
10400422013 is a wasteful number, since it uses less digits than its factorization.
10400422013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100975074.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 10400422013 its reverse (31022400401), we get a palindrome (41422822414).
The spelling of 10400422013 in words is "ten billion, four hundred million, four hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •