Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …110011100010001000000 |
3 | 10220020220022211210002101 |
4 | 100001121112130101000 |
5 | 121014332213323234 |
6 | 2201444120000144 |
7 | 142355033251024 |
oct | 20013126342100 |
9 | 3806808753071 |
10 | 1101010682944 |
11 | 394a32911057 |
12 | 159472300054 |
13 | 7ca952b5b13 |
14 | 3b4097d6384 |
15 | 1d98e592814 |
hex | 1005959c440 |
1101010682944 has 56 divisors (see below), whose sum is σ = 2222257907520. Its totient is φ = 541075121664.
The previous prime is 1101010682921. The next prime is 1101010682983. The reversal of 1101010682944 is 4492860101011.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23134437 + ... + 23181979.
It is an arithmetic number, because the mean of its divisors is an integer number (39683176920).
Almost surely, 21101010682944 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1101010682944, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1111128953760).
1101010682944 is an abundant number, since it is smaller than the sum of its proper divisors (1121247224576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101010682944 is an equidigital number, since it uses as much as digits as its factorization.
1101010682944 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53747 (or 53737 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 37.
Adding to 1101010682944 its reverse (4492860101011), we get a palindrome (5593870783955).
The spelling of 1101010682944 in words is "one trillion, one hundred one billion, ten million, six hundred eighty-two thousand, nine hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •