Base | Representation |
---|---|
bin | 11101011001010001011… |
… | …01011000100001001110 |
3 | 10120112222122202022021121 |
4 | 32230220231120201032 |
5 | 113021440034100420 |
6 | 2051553203351154 |
7 | 132653514620644 |
oct | 16545055304116 |
9 | 3515878668247 |
10 | 1010000300110 |
11 | 35a37a92542a |
12 | 1438b30824ba |
13 | 7432005c799 |
14 | 36c54647194 |
15 | 1b4146832aa |
hex | eb28b5884e |
1010000300110 has 8 divisors (see below), whose sum is σ = 1818000540216. Its totient is φ = 404000120040.
The previous prime is 1010000300047. The next prime is 1010000300117. The reversal of 1010000300110 is 110030000101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1010000300093 and 1010000300102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010000300117) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 50500014996 + ... + 50500015015.
It is an arithmetic number, because the mean of its divisors is an integer number (227250067527).
Almost surely, 21010000300110 is an apocalyptic number.
1010000300110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1010000300110 is a deficient number, since it is larger than the sum of its proper divisors (808000240106).
1010000300110 is a wasteful number, since it uses less digits than its factorization.
1010000300110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101000030018.
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 1010000300110 its reverse (110030000101), we get a palindrome (1120030300211).
The spelling of 1010000300110 in words is "one trillion, ten billion, three hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •