Base | Representation |
---|---|
bin | 10110111101110000100000… |
… | …110010110000100111110000 |
3 | 111020121121020102111121111220 |
4 | 112331300200302300213300 |
5 | 101214300022241010000 |
6 | 554451115214305040 |
7 | 30163036651164315 |
oct | 2675604062604760 |
9 | 436547212447456 |
10 | 101001001110000 |
11 | 2a200314043902 |
12 | b3b2806ab8180 |
13 | 4448479949c64 |
14 | 1ad26901b4d0c |
15 | ba2403d861a0 |
hex | 5bdc20cb09f0 |
101001001110000 has 200 divisors, whose sum is σ = 336562272397824. Its totient is φ = 26064774240000.
The previous prime is 101001001109993. The next prime is 101001001110011. The reversal of 101001001110000 is 11100100101.
It is a tau number, because it is divible by the number of its divisors (200).
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 congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 53371614 + ... + 55231613.
Almost surely, 2101001001110000 is an apocalyptic number.
101001001110000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101001001110000 is an abundant number, since it is smaller than the sum of its proper divisors (235561271287824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001001110000 is a wasteful number, since it uses less digits than its factorization.
101001001110000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108603289 (or 108603268 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 101001001110000 its reverse (11100100101), we get a palindrome (101012101210101).
The spelling of 101001001110000 in words is "one hundred one trillion, one billion, one million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •