Base | Representation |
---|---|
bin | 10011010111101100… |
… | …01111011011010101 |
3 | 222211202010222020121 |
4 | 21223312033123111 |
5 | 132244211100134 |
6 | 4435525231541 |
7 | 515463503401 |
oct | 115366173325 |
9 | 28752128217 |
10 | 10399315669 |
11 | 4457162866 |
12 | 20228625b1 |
13 | c9964c432 |
14 | 7091ca101 |
15 | 40ce88ab4 |
hex | 26bd8f6d5 |
10399315669 has 6 divisors (see below), whose sum is σ = 10409446070. Its totient is φ = 10389191880.
The previous prime is 10399315649. The next prime is 10399315673. The reversal of 10399315669 is 96651399301.
It can be written as a sum of positive squares in only one way, i.e., 10253992644 + 145323025 = 101262^2 + 12055^2 .
It is a de Polignac number, because none of the positive numbers 2k-10399315669 is a prime.
It is a super-2 number, since 2×103993156692 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10399315649) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4312074 + ... + 4314484.
Almost surely, 210399315669 is an apocalyptic number.
It is an amenable number.
10399315669 is a deficient number, since it is larger than the sum of its proper divisors (10130401).
10399315669 is an frugal number, since it uses more digits than its factorization.
10399315669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6611 (or 4200 counting only the distinct ones).
The product of its (nonzero) digits is 1180980, while the sum is 52.
The spelling of 10399315669 in words is "ten billion, three hundred ninety-nine million, three hundred fifteen thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •