Base | Representation |
---|---|
bin | 10011011000101010… |
… | …01011000110011101 |
3 | 222212022101221100110 |
4 | 21230111023012131 |
5 | 132303300040123 |
6 | 4440415120233 |
7 | 515622435141 |
oct | 115425130635 |
9 | 28768357313 |
10 | 10407424413 |
11 | 44607a1001 |
12 | 2025513079 |
13 | c9b22b1c9 |
14 | 70a2db221 |
15 | 40da3b493 |
hex | 26c54b19d |
10407424413 has 8 divisors (see below), whose sum is σ = 13999367808. Its totient is φ = 6876881984.
The previous prime is 10407424409. The next prime is 10407424421. The reversal of 10407424413 is 31442470401.
10407424413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10407424413 - 22 = 10407424409 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10407224413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15349845 + ... + 15350522.
It is an arithmetic number, because the mean of its divisors is an integer number (1749920976).
Almost surely, 210407424413 is an apocalyptic number.
It is an amenable number.
10407424413 is a deficient number, since it is larger than the sum of its proper divisors (3591943395).
10407424413 is a wasteful number, since it uses less digits than its factorization.
10407424413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30700483.
The product of its (nonzero) digits is 10752, while the sum is 30.
Adding to 10407424413 its reverse (31442470401), we get a palindrome (41849894814).
The spelling of 10407424413 in words is "ten billion, four hundred seven million, four hundred twenty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.258 sec. • engine limits •