| Base | Representation |
|---|---|
| bin | 10110111101110000100001… |
| … | …010100101011010011001100 |
| 3 | 111020121121021001020022210220 |
| 4 | 112331300201110223103030 |
| 5 | 101214300032030013400 |
| 6 | 554451120133031340 |
| 7 | 30163040116565016 |
| oct | 2675604124532314 |
| 9 | 436547231208726 |
| 10 | 101001010001100 |
| 11 | 2a200319066920 |
| 12 | b3b2809a85550 |
| 13 | 444847b740b71 |
| 14 | 1ad269144b1b6 |
| 15 | ba2404a407a0 |
| hex | 5bdc2152b4cc |
101001010001100 has 288 divisors, whose sum is σ = 326237009328384. Its totient is φ = 23913675878400.
The previous prime is 101001010001081. The next prime is 101001010001149. The reversal of 101001010001100 is 1100010100101.
101001010001100 is digitally balanced in base 3, 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 (6).
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 pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2360201304 + ... + 2360244096.
Almost surely, 2101001010001100 is an apocalyptic number.
101001010001100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101001010001100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163118504664192).
101001010001100 is an abundant number, since it is smaller than the sum of its proper divisors (225235999327284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001010001100 is a wasteful number, since it uses less digits than its factorization.
101001010001100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59497 (or 59490 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 101001010001100 its reverse (1100010100101), we get a palindrome (102101020101201).
Subtracting from 101001010001100 its reverse (1100010100101), we obtain a palindrome (99900999900999).
The spelling of 101001010001100 in words is "one hundred one trillion, one billion, ten million, one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •