Base | Representation |
---|---|
bin | 10100100110110000111… |
… | …011001000010000000000 |
3 | 12000100222100101122011000 |
4 | 110212300323020100000 |
5 | 141144443201440223 |
6 | 3002301314452000 |
7 | 204206052630000 |
oct | 24466073102000 |
9 | 5010870348130 |
10 | 1416012530688 |
11 | 4a6589181628 |
12 | 1aa523894000 |
13 | a36b61597c2 |
14 | 4c76d0c0000 |
15 | 26c78ccd543 |
hex | 149b0ec8400 |
1416012530688 has 880 divisors, whose sum is σ = 4970383911360. Its totient is φ = 398145355776.
The previous prime is 1416012530677. The next prime is 1416012530689. The reversal of 1416012530688 is 8860352106141.
1416012530688 is a `hidden beast` number, since 1 + 4 + 1 + 601 + 2 + 5 + 30 + 6 + 8 + 8 = 666.
It is not an unprimeable number, because it can be changed into a prime (1416012530689) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 5509776256 + ... + 5509776512.
Almost surely, 21416012530688 is an apocalyptic number.
1416012530688 is a gapful number since it is divisible by the number (18) 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 1416012530688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2485191955680).
1416012530688 is an abundant number, since it is smaller than the sum of its proper divisors (3554371380672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1416012530688 is an frugal number, since it uses more digits than its factorization.
1416012530688 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 397 (or 352 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 45.
The spelling of 1416012530688 in words is "one trillion, four hundred sixteen billion, twelve million, five hundred thirty thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •