| Base | Representation |
|---|---|
| bin | 1001000110001001000000… |
| … | …0101000001011111001000 |
| 3 | 1022102002120221010222102220 |
| 4 | 2101202100011001133020 |
| 5 | 2302324223340213000 |
| 6 | 33134235321254040 |
| 7 | 2051361415504302 |
| oct | 221422005013710 |
| 9 | 38362527128386 |
| 10 | 10001101101000 |
| 11 | 3206496930549 |
| 12 | 1156344634320 |
| 13 | 57713b303389 |
| 14 | 2680ad476972 |
| 15 | 1252419451a0 |
| hex | 918901417c8 |
10001101101000 has 256 divisors, whose sum is σ = 31384360949760. Its totient is φ = 2651528217600.
The previous prime is 10001101100989. The next prime is 10001101101007. The reversal of 10001101101000 is 10110110001.
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 self number, because there is not a number n which added to its sum of digits gives 10001101101000.
It is not an unprimeable number, because it can be changed into a prime (10001101101007) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 533183622 + ... + 533202378.
It is an arithmetic number, because the mean of its divisors is an integer number (122595159960).
Almost surely, 210001101101000 is an apocalyptic number.
10001101101000 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 10001101101000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15692180474880).
10001101101000 is an abundant number, since it is smaller than the sum of its proper divisors (21383259848760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001101101000 is a wasteful number, since it uses less digits than its factorization.
10001101101000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19801 (or 19787 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10001101101000 its reverse (10110110001), we get a palindrome (10011211211001).
Subtracting from 10001101101000 its reverse (10110110001), we obtain a palindrome (9990990990999).
The spelling of 10001101101000 in words is "ten trillion, one billion, one hundred one million, one hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •