Base | Representation |
---|---|
bin | 10100011001010000… |
… | …10000110100001101 |
3 | 1001021002001001011222 |
4 | 22030220100310031 |
5 | 134411010040334 |
6 | 5010253253125 |
7 | 535222336613 |
oct | 121450206415 |
9 | 31232031158 |
10 | 10949299469 |
11 | 4709659829 |
12 | 2156a941a5 |
13 | 1056585434 |
14 | 75c2736b3 |
15 | 4413c6d2e |
hex | 28ca10d0d |
10949299469 has 2 divisors, whose sum is σ = 10949299470. Its totient is φ = 10949299468.
The previous prime is 10949299441. The next prime is 10949299549. The reversal of 10949299469 is 96499294901.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10897272100 + 52027369 = 104390^2 + 7213^2 .
It is a cyclic number.
It is not a de Polignac number, because 10949299469 - 28 = 10949299213 is a prime.
It is a super-2 number, since 2×109492994692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10949299069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5474649734 + 5474649735.
It is an arithmetic number, because the mean of its divisors is an integer number (5474649735).
Almost surely, 210949299469 is an apocalyptic number.
It is an amenable number.
10949299469 is a deficient number, since it is larger than the sum of its proper divisors (1).
10949299469 is an equidigital number, since it uses as much as digits as its factorization.
10949299469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11337408, while the sum is 62.
The spelling of 10949299469 in words is "ten billion, nine hundred forty-nine million, two hundred ninety-nine thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •