| Base | Representation |
|---|---|
| bin | 10110111101101111101011… |
| … | …001001001001101010110100 |
| 3 | 111020121111220200210210120120 |
| 4 | 112331233223021021222310 |
| 5 | 101214241201324310400 |
| 6 | 554450450022131540 |
| 7 | 30163005441361335 |
| oct | 2675575311115264 |
| 9 | 436544820723516 |
| 10 | 101000101010100 |
| 11 | 2a1aa9a1a53496 |
| 12 | b3b25b5580bb0 |
| 13 | 4448365319c76 |
| 14 | 1ad260683028c |
| 15 | ba239ed39ca0 |
| hex | 5bdbeb249ab4 |
101000101010100 has 144 divisors (see below), whose sum is σ = 295131529748160. Its totient is φ = 26665678208000.
The previous prime is 101000101010063. The next prime is 101000101010101. The reversal of 101000101010100 is 1010101000101.
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 not an unprimeable number, because it can be changed into a prime (101000101010101) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1125266824 + ... + 1125356576.
It is an arithmetic number, because the mean of its divisors is an integer number (2049524512140).
Almost surely, 2101000101010100 is an apocalyptic number.
101000101010100 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 101000101010100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147565764874080).
101000101010100 is an abundant number, since it is smaller than the sum of its proper divisors (194131428738060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101000101010100 is a wasteful number, since it uses less digits than its factorization.
101000101010100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127010 (or 127003 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 101000101010100 its reverse (1010101000101), we get a palindrome (102010202010201).
Subtracting from 101000101010100 its reverse (1010101000101), we obtain a palindrome (99990000009999).
The spelling of 101000101010100 in words is "one hundred one trillion, one hundred one million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •