Base | Representation |
---|---|
bin | 10000101001011111100… |
… | …010000100010000101000 |
3 | 11001101000210101021112102 |
4 | 100221133202010100220 |
5 | 122221020400112400 |
6 | 2233324211232532 |
7 | 145440655054010 |
oct | 20513742042050 |
9 | 4041023337472 |
10 | 1144064066600 |
11 | 401216381464 |
12 | 1658888a8748 |
13 | 83b66b21170 |
14 | 3d531704c40 |
15 | 1eb5e1659d5 |
hex | 10a5f884428 |
1144064066600 has 192 divisors, whose sum is σ = 3276390297600. Its totient is φ = 361789102080.
The previous prime is 1144064066581. The next prime is 1144064066603. The reversal of 1144064066600 is 66604604411.
It is not an unprimeable number, because it can be changed into a prime (1144064066603) 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, 23435417 + ... + 23484183.
It is an arithmetic number, because the mean of its divisors is an integer number (17064532800).
Almost surely, 21144064066600 is an apocalyptic number.
1144064066600 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 1144064066600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1638195148800).
1144064066600 is an abundant number, since it is smaller than the sum of its proper divisors (2132326231000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1144064066600 is a wasteful number, since it uses less digits than its factorization.
1144064066600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50092 (or 50083 counting only the distinct ones).
The product of its (nonzero) digits is 82944, while the sum is 38.
The spelling of 1144064066600 in words is "one trillion, one hundred forty-four billion, sixty-four million, sixty-six thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •