Base | Representation |
---|---|
bin | 10100011111011101… |
… | …01010101100111010 |
3 | 1001101200220110020022 |
4 | 22033232222230322 |
5 | 140012313410020 |
6 | 5015352130442 |
7 | 536423410055 |
oct | 121756525472 |
9 | 31350813208 |
10 | 11001310010 |
11 | 4735a53049 |
12 | 2170396a22 |
13 | 10642959c2 |
14 | 765131a9c |
15 | 445c4c625 |
hex | 28fbaab3a |
11001310010 has 16 divisors (see below), whose sum is σ = 19896211872. Its totient is φ = 4379667600.
The previous prime is 11001310009. The next prime is 11001310013. The reversal of 11001310010 is 1001310011.
It is a super-2 number, since 2×110013100102 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11001310010.
It is not an unprimeable number, because it can be changed into a prime (11001310013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2604836 + ... + 2609055.
It is an arithmetic number, because the mean of its divisors is an integer number (1243513242).
Almost surely, 211001310010 is an apocalyptic number.
11001310010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11001310010 is a deficient number, since it is larger than the sum of its proper divisors (8894901862).
11001310010 is a wasteful number, since it uses less digits than its factorization.
11001310010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5214109.
The product of its (nonzero) digits is 3, while the sum is 8.
Adding to 11001310010 its reverse (1001310011), we get a palindrome (12002620021).
Subtracting from 11001310010 its reverse (1001310011), we obtain a palindrome (9999999999).
The spelling of 11001310010 in words is "eleven billion, one million, three hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •