| Base | Representation |
|---|---|
| bin | 10110111101101111101011… |
| … | …101011111010010000010000 |
| 3 | 111020121111221022221201202100 |
| 4 | 112331233223223322100100 |
| 5 | 101214241211142401000 |
| 6 | 554450450545320400 |
| 7 | 30163005612001545 |
| oct | 2675575353722020 |
| 9 | 436544838851670 |
| 10 | 101000110122000 |
| 11 | 2a1aa9a7107391 |
| 12 | b3b25b8636100 |
| 13 | 444836718a51b |
| 14 | 1ad2607b22bcc |
| 15 | ba23a0a39a00 |
| hex | 5bdbebafa410 |
101000110122000 has 960 divisors, whose sum is σ = 379004189054400. Its totient is φ = 25017082675200.
The previous prime is 101000110121987. The next prime is 101000110122007. The reversal of 101000110122000 is 221011000101.
It is a happy number.
It can be written as a sum of positive squares in 32 ways, for example, as 74397663166464 + 26602446955536 = 8625408^2 + 5157756^2 .
It is a super-2 number, since 2×1010001101220002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (101000110122007) by changing a digit.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 1718916622 + ... + 1718975378.
It is an arithmetic number, because the mean of its divisors is an integer number (394796030265).
Almost surely, 2101000110122000 is an apocalyptic number.
101000110122000 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 101000110122000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (189502094527200).
101000110122000 is an abundant number, since it is smaller than the sum of its proper divisors (278004078932400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101000110122000 is a wasteful number, since it uses less digits than its factorization.
101000110122000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58941 (or 58922 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 101000110122000 its reverse (221011000101), we get a palindrome (101221121122101).
The spelling of 101000110122000 in words is "one hundred one trillion, one hundred ten million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •