Base | Representation |
---|---|
bin | 1010000000111001100101… |
… | …0010111101011111011001 |
3 | 1102222121012202201222200001 |
4 | 2200032121102331133121 |
5 | 2420344123201023103 |
6 | 35230104253013001 |
7 | 2214326156560255 |
oct | 240163122753731 |
9 | 42877182658601 |
10 | 11010573064153 |
11 | 35656154a4563 |
12 | 1299b0a784161 |
13 | 61b3a5a68a30 |
14 | 2a0cb386d265 |
15 | 141624a1401d |
hex | a03994bd7d9 |
11010573064153 has 32 divisors (see below), whose sum is σ = 12442542070784. Its totient is φ = 9673071840000.
The previous prime is 11010573064121. The next prime is 11010573064159. The reversal of 11010573064153 is 35146037501011.
It is a cyclic number.
It is not a de Polignac number, because 11010573064153 - 25 = 11010573064121 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11010573064159) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 187317658 + ... + 187376428.
It is an arithmetic number, because the mean of its divisors is an integer number (388829439712).
Almost surely, 211010573064153 is an apocalyptic number.
11010573064153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11010573064153 is a deficient number, since it is larger than the sum of its proper divisors (1431969006631).
11010573064153 is a wasteful number, since it uses less digits than its factorization.
11010573064153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66497.
The product of its (nonzero) digits is 37800, while the sum is 37.
The spelling of 11010573064153 in words is "eleven trillion, ten billion, five hundred seventy-three million, sixty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •