Base | Representation |
---|---|
bin | 10000000001011000110… |
… | …001111011000111111010 |
3 | 10220020212122211102111021 |
4 | 100001120301323013322 |
5 | 121014322241010020 |
6 | 2201443134453054 |
7 | 142354556010424 |
oct | 20013061730772 |
9 | 3806778742437 |
10 | 1101001110010 |
11 | 394a2847283a |
12 | 15946b06418a |
13 | 7ca93313769 |
14 | 3b408423814 |
15 | 1d98d8011aa |
hex | 10058c7b1fa |
1101001110010 has 32 divisors (see below), whose sum is σ = 2041480324800. Its totient is φ = 427258611840.
The previous prime is 1101001109983. The next prime is 1101001110023. The reversal of 1101001110010 is 100111001011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1101001109975 and 1101001110002.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7427640 + ... + 7574419.
It is an arithmetic number, because the mean of its divisors is an integer number (63796260150).
Almost surely, 21101001110010 is an apocalyptic number.
1101001110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1101001110010 is a deficient number, since it is larger than the sum of its proper divisors (940479214790).
1101001110010 is a wasteful number, since it uses less digits than its factorization.
1101001110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15002286.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1101001110010 its reverse (100111001011), we get a palindrome (1201112111021).
The spelling of 1101001110010 in words is "one trillion, one hundred one billion, one million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •