Base | Representation |
---|---|
bin | 11001000000101101011110… |
… | …111111000100100101011010 |
3 | 112102110220020012110002120212 |
4 | 121000231132333010211122 |
5 | 103404220000224310020 |
6 | 1025541145225251122 |
7 | 32112144366224306 |
oct | 3100553677044532 |
9 | 472426205402525 |
10 | 110000001010010 |
11 | 3205a813970011 |
12 | 104068a1933aa2 |
13 | 494bc565660b7 |
14 | 1d24058124d06 |
15 | cab544861cc5 |
hex | 640b5efc495a |
110000001010010 has 64 divisors (see below), whose sum is σ = 202868942369184. Its totient is φ = 42927383116800.
The previous prime is 110000001009979. The next prime is 110000001010043. The reversal of 110000001010010 is 10010100000011.
110000001010010 is digitally balanced in base 3, 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 16 ways, for example, as 36400262427169 + 73599738582841 = 6033263^2 + 8579029^2 .
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a junction number, because it is equal to n+sod(n) for n = 110000001009976 and 110000001010003.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1191500372 + ... + 1191592688.
Almost surely, 2110000001010010 is an apocalyptic number.
110000001010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110000001010010 is a deficient number, since it is larger than the sum of its proper divisors (92868941359174).
110000001010010 is a wasteful number, since it uses less digits than its factorization.
110000001010010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104979.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 110000001010010 its reverse (10010100000011), we get a palindrome (120010101010021).
The spelling of 110000001010010 in words is "one hundred ten trillion, one million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •