Base | Representation |
---|---|
bin | 10011011000101001… |
… | …10110001011111101 |
3 | 222212022020120211201 |
4 | 21230110312023331 |
5 | 132303234314444 |
6 | 4440413215501 |
7 | 515621630323 |
oct | 115424661375 |
9 | 28768216751 |
10 | 10407338749 |
11 | 4460742705 |
12 | 2025491591 |
13 | c9b1cb212 |
14 | 70a2b7d13 |
15 | 40da20dd4 |
hex | 26c5362fd |
10407338749 has 8 divisors (see below), whose sum is σ = 11599511040. Its totient is φ = 9279608256.
The previous prime is 10407338743. The next prime is 10407338789. The reversal of 10407338749 is 94783370401.
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 10407338749 - 221 = 10405241597 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10407338699 and 10407338708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10407338743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16110109 + ... + 16110754.
It is an arithmetic number, because the mean of its divisors is an integer number (1449938880).
Almost surely, 210407338749 is an apocalyptic number.
10407338749 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
10407338749 is a deficient number, since it is larger than the sum of its proper divisors (1192172291).
10407338749 is a wasteful number, since it uses less digits than its factorization.
10407338749 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32220899.
The product of its (nonzero) digits is 508032, while the sum is 46.
The spelling of 10407338749 in words is "ten billion, four hundred seven million, three hundred thirty-eight thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •