Base | Representation |
---|---|
bin | 1010000000010101111101… |
… | …0010110001010100101001 |
3 | 1102221200112022011001111000 |
4 | 2200011133102301110221 |
5 | 2420220032030014233 |
6 | 35221443315225213 |
7 | 2213540166100242 |
oct | 240053722612451 |
9 | 42850468131430 |
10 | 11001010001193 |
11 | 3561558393843 |
12 | 129809bba8209 |
13 | 61a5107534b4 |
14 | 2a0647767cc9 |
15 | 1412651b3d13 |
hex | a015f4b1529 |
11001010001193 has 64 divisors (see below), whose sum is σ = 16574361108480. Its totient is φ = 7210494365184.
The previous prime is 11001010001173. The next prime is 11001010001197. The reversal of 11001010001193 is 39110001010011.
It is not a de Polignac number, because 11001010001193 - 220 = 11001008952617 is a prime.
It is a super-2 number, since 2×110010100011932 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11001010001197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 397895896 + ... + 397923542.
It is an arithmetic number, because the mean of its divisors is an integer number (258974392320).
Almost surely, 211001010001193 is an apocalyptic number.
It is an amenable number.
11001010001193 is a deficient number, since it is larger than the sum of its proper divisors (5573351107287).
11001010001193 is a wasteful number, since it uses less digits than its factorization.
11001010001193 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28595 (or 28589 counting only the distinct ones).
The product of its (nonzero) digits is 27, while the sum is 18.
The spelling of 11001010001193 in words is "eleven trillion, one billion, ten million, one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •