Base | Representation |
---|---|
bin | 11001000000101110011010… |
… | …100001111101000100011010 |
3 | 112102110222210211020112221212 |
4 | 121000232122201331010122 |
5 | 103404224022000310020 |
6 | 1025541432313303122 |
7 | 32112211216461614 |
oct | 3100563241750432 |
9 | 472428724215855 |
10 | 110001000010010 |
11 | 3206018687054a |
12 | 10406b20404aa2 |
13 | 494c085513065 |
14 | 1d24110a91db4 |
15 | cab5a23e6cc5 |
hex | 640b9a87d11a |
110001000010010 has 16 divisors (see below), whose sum is σ = 198007115745096. Its totient is φ = 43999218731328.
The previous prime is 110001000010001. The next prime is 110001000010129. The reversal of 110001000010010 is 10010000100011.
It can be written as a sum of positive squares in 4 ways, for example, as 107837985633049 + 2163014376961 = 10384507^2 + 1470719^2 .
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 110001000009976 and 110001000010003.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 147267929 + ... + 148012988.
Almost surely, 2110001000010010 is an apocalyptic number.
110001000010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110001000010010 is a deficient number, since it is larger than the sum of its proper divisors (88006115735086).
110001000010010 is a wasteful number, since it uses less digits than its factorization.
110001000010010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295318177.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 110001000010010 its reverse (10010000100011), we get a palindrome (120011000110021).
Subtracting from 110001000010010 its reverse (10010000100011), we obtain a palindrome (99990999909999).
The spelling of 110001000010010 in words is "one hundred ten trillion, one billion, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •