Base | Representation |
---|---|
bin | 10100011111100011… |
… | …01110000010110010 |
3 | 1001101202102002210101 |
4 | 22033301232002302 |
5 | 140013020011010 |
6 | 5015421223014 |
7 | 536433251554 |
oct | 121761560262 |
9 | 31352362711 |
10 | 11002110130 |
11 | 473644a200 |
12 | 2170701a6a |
13 | 10644b5c4b |
14 | 76529d4d4 |
15 | 445d5973a |
hex | 28fc6e0b2 |
11002110130 has 24 divisors (see below), whose sum is σ = 21767813676. Its totient is φ = 4000766880.
The previous prime is 11002110127. The next prime is 11002110131. The reversal of 11002110130 is 3101120011.
11002110130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9228099969 + 1774010161 = 96063^2 + 42119^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (11002110131) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 4545117 + ... + 4547536.
Almost surely, 211002110130 is an apocalyptic number.
11002110130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11002110130 is a deficient number, since it is larger than the sum of its proper divisors (10765703546).
11002110130 is a wasteful number, since it uses less digits than its factorization.
11002110130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9092682 (or 9092671 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 11002110130 its reverse (3101120011), we get a palindrome (14103230141).
The spelling of 11002110130 in words is "eleven billion, two million, one hundred ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •