Base | Representation |
---|---|
bin | 10110111111001101111011… |
… | …001000100001011010000100 |
3 | 111020222012010111110120002210 |
4 | 112333031323020201122010 |
5 | 101222420431024341400 |
6 | 555005144013303420 |
7 | 30203220326244054 |
oct | 2677157310413204 |
9 | 436865114416083 |
10 | 101101301012100 |
11 | 2a239903796884 |
12 | b40a139194b70 |
13 | 4454a72621a5c |
14 | 1ad7486dc1564 |
15 | ba4d245b0950 |
hex | 5bf37b221684 |
101101301012100 has 72 divisors (see below), whose sum is σ = 307915541345440. Its totient is φ = 25541381306880.
The previous prime is 101101301012093. The next prime is 101101301012113. The reversal of 101101301012100 is 1210103101101.
101101301012100 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8868529477 + ... + 8868540876.
Almost surely, 2101101301012100 is an apocalyptic number.
101101301012100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101101301012100 is an abundant number, since it is smaller than the sum of its proper divisors (206814240333340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101101301012100 is a wasteful number, since it uses less digits than its factorization.
101101301012100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17737070389 (or 17737070382 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 101101301012100 its reverse (1210103101101), we get a palindrome (102311404113201).
The spelling of 101101301012100 in words is "one hundred one trillion, one hundred one billion, three hundred one million, twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •