Base | Representation |
---|---|
bin | 11101000110101010100… |
… | …00001101111011000010 |
3 | 10112121012102122012100121 |
4 | 32203111100031323002 |
5 | 112341010103223020 |
6 | 2043222013210454 |
7 | 132151120354516 |
oct | 16432520157302 |
9 | 3477172565317 |
10 | 1000010211010 |
11 | 35611376a648 |
12 | 141985490a2a |
13 | 733ba432465 |
14 | 36587944146 |
15 | 1b02c5d1baa |
hex | e8d540dec2 |
1000010211010 has 8 divisors (see below), whose sum is σ = 1800018379836. Its totient is φ = 400004084400.
The previous prime is 1000010210981. The next prime is 1000010211089. The reversal of 1000010211010 is 101120100001.
It can be written as a sum of positive squares in 2 ways, for example, as 906553441161 + 93456769849 = 952131^2 + 305707^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 = 1000010210984 and 1000010211002.
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, 50000510541 + ... + 50000510560.
Almost surely, 21000010211010 is an apocalyptic number.
1000010211010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1000010211010 is a deficient number, since it is larger than the sum of its proper divisors (800008168826).
1000010211010 is a wasteful number, since it uses less digits than its factorization.
1000010211010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100001021108.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 1000010211010 its reverse (101120100001), we get a palindrome (1101130311011).
The spelling of 1000010211010 in words is "one trillion, ten million, two hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •