Base | Representation |
---|---|
bin | 10100101011001110… |
… | …01000111011100010 |
3 | 1001122120121102102000 |
4 | 22111213020323202 |
5 | 140213044444340 |
6 | 5033235304430 |
7 | 542032304643 |
oct | 122547107342 |
9 | 31576542360 |
10 | 11099999970 |
11 | 478672a2a4 |
12 | 219944b116 |
13 | 107b86b127 |
14 | 7742a16ca |
15 | 44e743d30 |
hex | 2959c8ee2 |
11099999970 has 64 divisors (see below), whose sum is σ = 29887453440. Its totient is φ = 2931254784.
The previous prime is 11099999969. The next prime is 11100000001. The reversal of 11099999970 is 7999999011.
11099999970 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×110999999703 (a number of 31 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11099999898 and 11099999907.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 171759 + ... + 227378.
It is an arithmetic number, because the mean of its divisors is an integer number (466991460).
Almost surely, 211099999970 is an apocalyptic number.
11099999970 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11099999970 is an abundant number, since it is smaller than the sum of its proper divisors (18787453470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11099999970 is a wasteful number, since it uses less digits than its factorization.
11099999970 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 399256 (or 399250 counting only the distinct ones).
The product of its (nonzero) digits is 3720087, while the sum is 63.
The spelling of 11099999970 in words is "eleven billion, ninety-nine million, nine hundred ninety-nine thousand, nine hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •