Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00011010001010010 |
3 | 1001102101100100020210 |
4 | 22100110003101102 |
5 | 140022321004340 |
6 | 5020342144550 |
7 | 536602614300 |
oct | 122024032122 |
9 | 31371310223 |
10 | 11011109970 |
11 | 4740536993 |
12 | 2173722156 |
13 | 10663174b3 |
14 | 766563270 |
15 | 446a36180 |
hex | 290503452 |
11011109970 has 48 divisors (see below), whose sum is σ = 30741225408. Its totient is φ = 2516824800.
The previous prime is 11011109959. The next prime is 11011109971. The reversal of 11011109970 is 7990111011.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11011109971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3743806 + ... + 3746745.
It is an arithmetic number, because the mean of its divisors is an integer number (640442196).
Almost surely, 211011109970 is an apocalyptic number.
11011109970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11011109970 is an abundant number, since it is smaller than the sum of its proper divisors (19730115438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11011109970 is a wasteful number, since it uses less digits than its factorization.
11011109970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7490575 (or 7490568 counting only the distinct ones).
The product of its (nonzero) digits is 567, while the sum is 30.
The spelling of 11011109970 in words is "eleven billion, eleven million, one hundred nine thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •