Base | Representation |
---|---|
bin | 1001000110101011011011… |
… | …1101100111001001100010 |
3 | 1022102222110001011121212020 |
4 | 2101222312331213021202 |
5 | 2303002140402413010 |
6 | 33142404400042310 |
7 | 2052136433002416 |
oct | 221526675471142 |
9 | 38388401147766 |
10 | 10010343404130 |
11 | 320a3a99786a3 |
12 | 11580a3903396 |
13 | 577c8202c8b4 |
14 | 268708b22d46 |
15 | 1255d3035470 |
hex | 91ab6f67262 |
10010343404130 has 32 divisors (see below), whose sum is σ = 24025003519104. Its totient is φ = 2669404980096.
The previous prime is 10010343404099. The next prime is 10010343404153. The reversal of 10010343404130 is 3140434301001.
It is a self number, because there is not a number n which added to its sum of digits gives 10010343404130.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3087259 + ... + 5436161.
It is an arithmetic number, because the mean of its divisors is an integer number (750781359972).
Almost surely, 210010343404130 is an apocalyptic number.
10010343404130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10010343404130 is an abundant number, since it is smaller than the sum of its proper divisors (14014660114974).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010343404130 is a wasteful number, since it uses less digits than its factorization.
10010343404130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2490970.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 10010343404130 its reverse (3140434301001), we get a palindrome (13150777705131).
The spelling of 10010343404130 in words is "ten trillion, ten billion, three hundred forty-three million, four hundred four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •