Base | Representation |
---|---|
bin | 1010000010110100101101… |
… | …1000101110101011011110 |
3 | 1110002202112021002110000222 |
4 | 2200231023120232223132 |
5 | 2421414321134114440 |
6 | 35253212133321342 |
7 | 2216606224352342 |
oct | 240551330565336 |
9 | 43082467073028 |
10 | 11043625691870 |
11 | 3578636883a12 |
12 | 12a43b3a96252 |
13 | 6215426b0805 |
14 | 2a272b49d622 |
15 | 14240b62a2b5 |
hex | a0b4b62eade |
11043625691870 has 32 divisors (see below), whose sum is σ = 20714094878400. Its totient is φ = 4233992094976.
The previous prime is 11043625691809. The next prime is 11043625691897. The reversal of 11043625691870 is 7819652634011.
It is a super-2 number, since 2×110436256918702 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 138943730 + ... + 139023189.
It is an arithmetic number, because the mean of its divisors is an integer number (647315464950).
It is a 1-persistent number, because it is pandigital, but 2⋅11043625691870 = 22087251383740 is not.
Almost surely, 211043625691870 is an apocalyptic number.
11043625691870 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11043625691870 is a deficient number, since it is larger than the sum of its proper divisors (9670469186530).
11043625691870 is a wasteful number, since it uses less digits than its factorization.
11043625691870 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277967092.
The product of its (nonzero) digits is 2177280, while the sum is 53.
The spelling of 11043625691870 in words is "eleven trillion, forty-three billion, six hundred twenty-five million, six hundred ninety-one thousand, eight hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •