Base | Representation |
---|---|
bin | 10000110000011000011… |
… | …000011111100010000000 |
3 | 11002002010020201022212120 |
4 | 100300120120133202000 |
5 | 122331142314342440 |
6 | 2240550142324240 |
7 | 146122155065202 |
oct | 20603030374200 |
9 | 4062106638776 |
10 | 1151460309120 |
11 | 404371364990 |
12 | 1671b1889680 |
13 | 84775251324 |
14 | 3da33b28772 |
15 | 1ee4364edd0 |
hex | 10c1861f880 |
1151460309120 has 1024 divisors, whose sum is σ = 4334702584320. Its totient is φ = 256901120000.
The previous prime is 1151460309119. The next prime is 1151460309127. The reversal of 1151460309120 is 219030641511.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (1151460309127) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 4097723380 + ... + 4097723660.
Almost surely, 21151460309120 is an apocalyptic number.
1151460309120 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 1151460309120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2167351292160).
1151460309120 is an abundant number, since it is smaller than the sum of its proper divisors (3183242275200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1151460309120 is a wasteful number, since it uses less digits than its factorization.
1151460309120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 545 (or 533 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 33.
The spelling of 1151460309120 in words is "one trillion, one hundred fifty-one billion, four hundred sixty million, three hundred nine thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •