Base | Representation |
---|---|
bin | 1001111101010110001110… |
… | …1110010111100000110101 |
3 | 1102202202200121011202000100 |
4 | 2133111203232113200311 |
5 | 2413344131423034241 |
6 | 35142052412104313 |
7 | 2210035632420555 |
oct | 237254356274065 |
9 | 42682617152010 |
10 | 10949544736821 |
11 | 35417486059a9 |
12 | 128a118465099 |
13 | 6156cb263b42 |
14 | 29bd645b7165 |
15 | 13ec51d869b6 |
hex | 9f563b97835 |
10949544736821 has 12 divisors (see below), whose sum is σ = 15817415953248. Its totient is φ = 7299047157864.
The previous prime is 10949544736813. The next prime is 10949544736849. The reversal of 10949544736821 is 12863744594901.
10949544736821 is a `hidden beast` number, since 1 + 0 + 9 + 4 + 9 + 544 + 7 + 3 + 6 + 82 + 1 = 666.
It is not a de Polignac number, because 10949544736821 - 23 = 10949544736813 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10949544736421) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 54004305 + ... + 54206678.
It is an arithmetic number, because the mean of its divisors is an integer number (1318117996104).
It is a 1-persistent number, because it is pandigital, but 2⋅10949544736821 = 21899089473642 is not.
Almost surely, 210949544736821 is an apocalyptic number.
It is an amenable number.
10949544736821 is a deficient number, since it is larger than the sum of its proper divisors (4867871216427).
10949544736821 is a wasteful number, since it uses less digits than its factorization.
10949544736821 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108222232 (or 108222229 counting only the distinct ones).
The product of its (nonzero) digits is 52254720, while the sum is 63.
The spelling of 10949544736821 in words is "ten trillion, nine hundred forty-nine billion, five hundred forty-four million, seven hundred thirty-six thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •