Base | Representation |
---|---|
bin | 10100011110101010… |
… | …10000101100101101 |
3 | 1001101020101002021121 |
4 | 22033111100230231 |
5 | 140004112244101 |
6 | 5014553300541 |
7 | 536312660614 |
oct | 121725205455 |
9 | 31336332247 |
10 | 10994649901 |
11 | 4732214224 |
12 | 216a104751 |
13 | 1062aa3401 |
14 | 7642ba87b |
15 | 4453840a1 |
hex | 28f550b2d |
10994649901 has 16 divisors (see below), whose sum is σ = 11151169920. Its totient is φ = 10839628800.
The previous prime is 10994649893. The next prime is 10994649907.
10994649901 is nontrivially palindromic in base 10.
10994649901 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10994649901 - 23 = 10994649893 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10994649907) 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 15 ways as a sum of consecutive naturals, for example, 16683510 + ... + 16684168.
It is an arithmetic number, because the mean of its divisors is an integer number (696948120).
Almost surely, 210994649901 is an apocalyptic number.
It is an amenable number.
10994649901 is a deficient number, since it is larger than the sum of its proper divisors (156520019).
10994649901 is a wasteful number, since it uses less digits than its factorization.
10994649901 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1476.
The product of its (nonzero) digits is 629856, while the sum is 52.
The spelling of 10994649901 in words is "ten billion, nine hundred ninety-four million, six hundred forty-nine thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •