Base | Representation |
---|---|
bin | 10011011101101011… |
… | …01001101010111101 |
3 | 222222020120020011000 |
4 | 21232311221222331 |
5 | 132400032231134 |
6 | 4444520520513 |
7 | 516643136130 |
oct | 115665515275 |
9 | 28866506130 |
10 | 10449492669 |
11 | 4482514560 |
12 | 2037620139 |
13 | ca6b6a275 |
14 | 711b2c217 |
15 | 41259ae99 |
hex | 26ed69abd |
10449492669 has 32 divisors (see below), whose sum is σ = 19300654080. Its totient is φ = 5428306800.
The previous prime is 10449492649. The next prime is 10449492689. The reversal of 10449492669 is 96629494401.
It is a happy number.
10449492669 is a `hidden beast` number, since 1 + 0 + 4 + 494 + 92 + 6 + 69 = 666.
It is an interprime number because it is at equal distance from previous prime (10449492649) and next prime (10449492689).
It is not a de Polignac number, because 10449492669 - 28 = 10449492413 is a prime.
It is a super-2 number, since 2×104494926692 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10449492649) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2511027 + ... + 2515184.
It is an arithmetic number, because the mean of its divisors is an integer number (603145440).
Almost surely, 210449492669 is an apocalyptic number.
It is an amenable number.
10449492669 is a deficient number, since it is larger than the sum of its proper divisors (8851161411).
10449492669 is a wasteful number, since it uses less digits than its factorization.
10449492669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5026238 (or 5026232 counting only the distinct ones).
The product of its (nonzero) digits is 3359232, while the sum is 54.
The spelling of 10449492669 in words is "ten billion, four hundred forty-nine million, four hundred ninety-two thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •