Base | Representation |
---|---|
bin | 10000001001011100011… |
… | …010100100100000000000 |
3 | 10221002012120001202210110 |
4 | 100021130122210200000 |
5 | 121140031410001423 |
6 | 2205433410031320 |
7 | 143112132433020 |
oct | 20113432444000 |
9 | 3832176052713 |
10 | 1109652031488 |
11 | 398667709120 |
12 | 15b084278540 |
13 | 80841671100 |
14 | 3b9c932ba80 |
15 | 1dce8027193 |
hex | 1025c6a4800 |
1109652031488 has 576 divisors, whose sum is σ = 3994162099200. Its totient is φ = 266031267840.
The previous prime is 1109652031459. The next prime is 1109652031489. The reversal of 1109652031488 is 8841302569011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (1109652031489) 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, 79944933 + ... + 79958811.
It is an arithmetic number, because the mean of its divisors is an integer number (6934309200).
Almost surely, 21109652031488 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 1109652031488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1997081049600).
1109652031488 is an abundant number, since it is smaller than the sum of its proper divisors (2884510067712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1109652031488 is a wasteful number, since it uses less digits than its factorization.
1109652031488 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13948 (or 13915 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 48.
The spelling of 1109652031488 in words is "one trillion, one hundred nine billion, six hundred fifty-two million, thirty-one thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •