Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …1001111011001000011000 |
3 | 1022102002100120221012121220 |
4 | 2101202022221323020120 |
5 | 2302324032042023000 |
6 | 33134222311132040 |
7 | 2051356232216316 |
oct | 221421251731030 |
9 | 38362316835556 |
10 | 10001010111000 |
11 | 320644a5333a7 |
12 | 115631a074020 |
13 | 5771254c593c |
14 | 2680a134d0b6 |
15 | 1252389701a0 |
hex | 9188aa7b218 |
10001010111000 has 128 divisors (see below), whose sum is σ = 31383518212800. Its totient is φ = 2651520076800.
The previous prime is 10001010110969. The next prime is 10001010111013. The reversal of 10001010111000 is 11101010001.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a self number, because there is not a number n which added to its sum of digits gives 10001010111000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9115885 + ... + 10153884.
Almost surely, 210001010111000 is an apocalyptic number.
10001010111000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10001010111000 is an abundant number, since it is smaller than the sum of its proper divisors (21382508101800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001010111000 is a wasteful number, since it uses less digits than its factorization.
10001010111000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19269966 (or 19269952 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10001010111000 its reverse (11101010001), we get a palindrome (10012111121001).
The spelling of 10001010111000 in words is "ten trillion, one billion, ten million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •