| Base | Representation |
|---|---|
| bin | 10010111000111010… |
| … | …10000111101010100 |
| 3 | 222011202021202210101 |
| 4 | 21130131100331110 |
| 5 | 131232111010400 |
| 6 | 4354143103444 |
| 7 | 506210004442 |
| oct | 113435207524 |
| 9 | 28152252711 |
| 10 | 10141110100 |
| 11 | 4334435130 |
| 12 | 1b702a1b84 |
| 13 | c57cc5b84 |
| 14 | 6c2bb5b92 |
| 15 | 3e548356a |
| hex | 25c750f54 |
10141110100 has 144 divisors (see below), whose sum is σ = 24986900736. Its totient is φ = 3540160000.
The previous prime is 10141110061. The next prime is 10141110101. The reversal of 10141110100 is 101114101.
10141110100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×101411101002 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10141110101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2738250 + ... + 2741950.
It is an arithmetic number, because the mean of its divisors is an integer number (173520144).
Almost surely, 210141110100 is an apocalyptic number.
10141110100 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 10141110100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12493450368).
10141110100 is an abundant number, since it is smaller than the sum of its proper divisors (14845790636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10141110100 is a wasteful number, since it uses less digits than its factorization.
10141110100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3826 (or 3819 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 10141110100 its reverse (101114101), we get a palindrome (10242224201).
The spelling of 10141110100 in words is "ten billion, one hundred forty-one million, one hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •