Base | Representation |
---|---|
bin | 1001001011111001110101… |
… | …1110000000001111010110 |
3 | 1022202120011000212020020021 |
4 | 2102332131132000033112 |
5 | 2310440011130013420 |
6 | 33251532041455354 |
7 | 2061465066330613 |
oct | 222763536001726 |
9 | 38676130766207 |
10 | 10100110001110 |
11 | 3244483871628 |
12 | 11715764a155a |
13 | 5835896a097c |
14 | 26cbc2a2550a |
15 | 127ad8b5a7aa |
hex | 92f9d7803d6 |
10100110001110 has 8 divisors (see below), whose sum is σ = 18180198002016. Its totient is φ = 4040044000440.
The previous prime is 10100110001101. The next prime is 10100110001131. The reversal of 10100110001110 is 1110001100101.
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 = 10100110001093 and 10100110001102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 505005500046 + ... + 505005500065.
It is an arithmetic number, because the mean of its divisors is an integer number (2272524750252).
Almost surely, 210100110001110 is an apocalyptic number.
10100110001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10100110001110 is a deficient number, since it is larger than the sum of its proper divisors (8080088000906).
10100110001110 is a wasteful number, since it uses less digits than its factorization.
10100110001110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010011000118.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 10100110001110 its reverse (1110001100101), we get a palindrome (11210111101211).
The spelling of 10100110001110 in words is "ten trillion, one hundred billion, one hundred ten million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •