Base | Representation |
---|---|
bin | 10100100000101000… |
… | …11001011111100001 |
3 | 1001102101111222010000 |
4 | 22100110121133201 |
5 | 140022331412433 |
6 | 5020344130213 |
7 | 536603443542 |
oct | 122024313741 |
9 | 31371458100 |
10 | 11011200993 |
11 | 4740599311 |
12 | 2173766969 |
13 | 1066349a60 |
14 | 7665884c9 |
15 | 446a53113 |
hex | 2905197e1 |
11011200993 has 20 divisors (see below), whose sum is σ = 17714127508. Its totient is φ = 6776123040.
The previous prime is 11011200979. The next prime is 11011201013. The reversal of 11011200993 is 39900211011.
It can be written as a sum of positive squares in 2 ways, for example, as 6341255424 + 4669945569 = 79632^2 + 68337^2 .
It is not a de Polignac number, because 11011200993 - 212 = 11011196897 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11011200913) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 5227438 + ... + 5229543.
Almost surely, 211011200993 is an apocalyptic number.
11011200993 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11011200993 is a deficient number, since it is larger than the sum of its proper divisors (6702926515).
11011200993 is a wasteful number, since it uses less digits than its factorization.
11011200993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10457006 (or 10456997 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 27.
The spelling of 11011200993 in words is "eleven billion, eleven million, two hundred thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •