Base | Representation |
---|---|
bin | 1001000110000101010100… |
… | …0000101001111000101010 |
3 | 1022102000000212101220122112 |
4 | 2101201111000221320222 |
5 | 2302320211141200020 |
6 | 33133553120522322 |
7 | 2051325023233502 |
oct | 221412500517052 |
9 | 38360025356575 |
10 | 10000110100010 |
11 | 32060284a3868 |
12 | 11561087803a2 |
13 | 577010bc7264 |
14 | 2680179cca02 |
15 | 1251d49402c5 |
hex | 91855029e2a |
10000110100010 has 16 divisors (see below), whose sum is σ = 18002529045216. Its totient is φ = 3999526069968.
The previous prime is 10000110099983. The next prime is 10000110100027. The reversal of 10000110100010 is 1000101100001.
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 = 10000110099967 and 10000110100003.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 64665164 + ... + 64819623.
It is an arithmetic number, because the mean of its divisors is an integer number (1125158065326).
Almost surely, 210000110100010 is an apocalyptic number.
10000110100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10000110100010 is a deficient number, since it is larger than the sum of its proper divisors (8002418945206).
10000110100010 is a wasteful number, since it uses less digits than its factorization.
10000110100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129492517.
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 10000110100010 its reverse (1000101100001), we get a palindrome (11000211200011).
Subtracting from 10000110100010 its reverse (1000101100001), we obtain a palindrome (9000009000009).
The spelling of 10000110100010 in words is "ten trillion, one hundred ten million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •