Base | Representation |
---|---|
bin | 11101000110101010011… |
… | …11011010011010001010 |
3 | 10112121012102020110220210 |
4 | 32203111033122122022 |
5 | 112341010030000020 |
6 | 2043222004501550 |
7 | 132151115515410 |
oct | 16432517323212 |
9 | 3477172213823 |
10 | 1000010000010 |
11 | 35611363606a |
12 | 1419853aa8b6 |
13 | 733ba38a3c8 |
14 | 365878cb2b0 |
15 | 1b02c58e3e0 |
hex | e8d53da68a |
1000010000010 has 32 divisors (see below), whose sum is σ = 2742884572032. Its totient is φ = 228573714240.
The previous prime is 1000009999981. The next prime is 1000010000023. The reversal of 1000010000010 is 100000100001.
It is a Harshad number since it is a multiple of its sum of digits (3).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2380975981 + ... + 2380976400.
It is an arithmetic number, because the mean of its divisors is an integer number (85715142876).
Almost surely, 21000010000010 is an apocalyptic number.
1000010000010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1000010000010 is an abundant number, since it is smaller than the sum of its proper divisors (1742874572022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000010000010 is a wasteful number, since it uses less digits than its factorization.
1000010000010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4761952398.
The product of its (nonzero) digits is 1, while the sum is 3.
Adding to 1000010000010 its reverse (100000100001), we get a palindrome (1100010100011).
Subtracting from 1000010000010 its reverse (100000100001), we obtain a palindrome (900009900009).
The spelling of 1000010000010 in words is "one trillion, ten million, ten", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •