Base | Representation |
---|---|
bin | 11101000111000010010… |
… | …10110001011000111010 |
3 | 10112121201100210010020021 |
4 | 32203201022301120322 |
5 | 112341412242010020 |
6 | 2043253513521054 |
7 | 132156065441446 |
oct | 16434112613072 |
9 | 3477640703207 |
10 | 1000210110010 |
11 | 356206593731 |
12 | 141a2041318a |
13 | 7341c9827a7 |
14 | 365a62db826 |
15 | 1b03ee1b1aa |
hex | e8e12b163a |
1000210110010 has 8 divisors (see below), whose sum is σ = 1800378198036. Its totient is φ = 400084044000.
The previous prime is 1000210109981. The next prime is 1000210110089. The reversal of 1000210110010 is 100110120001.
It can be written as a sum of positive squares in 2 ways, for example, as 875532618601 + 124677491409 = 935699^2 + 353097^2 .
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 = 1000210109975 and 1000210110002.
It is an unprimeable number.
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, 50010505491 + ... + 50010505510.
Almost surely, 21000210110010 is an apocalyptic number.
1000210110010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1000210110010 is a deficient number, since it is larger than the sum of its proper divisors (800168088026).
1000210110010 is a wasteful number, since it uses less digits than its factorization.
1000210110010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100021011008.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1000210110010 its reverse (100110120001), we get a palindrome (1100320230011).
Subtracting from 1000210110010 its reverse (100110120001), we obtain a palindrome (900099990009).
The spelling of 1000210110010 in words is "one trillion, two hundred ten million, one hundred ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •