Base | Representation |
---|---|
bin | 10100100110100100010… |
… | …000011100110011000000 |
3 | 12000100102112111202220000 |
4 | 110212210100130303000 |
5 | 141144024301003224 |
6 | 3002224243520000 |
7 | 204200562400560 |
oct | 24464420346300 |
9 | 5010375452800 |
10 | 1415800016064 |
11 | 4a648a221205 |
12 | 1aa484689000 |
13 | a36811101c5 |
14 | 4c74cba0da0 |
15 | 26c653010c9 |
hex | 149a441ccc0 |
1415800016064 has 560 divisors, whose sum is σ = 4888614950208. Its totient is φ = 396801441792.
The previous prime is 1415800016053. The next prime is 1415800016083. The reversal of 1415800016064 is 4606100085141.
1415800016064 is a `hidden beast` number, since 1 + 4 + 1 + 580 + 0 + 0 + 16 + 0 + 64 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 521856372 + ... + 521859084.
Almost surely, 21415800016064 is an apocalyptic number.
1415800016064 is a gapful number since it is divisible by the number (14) 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 1415800016064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2444307475104).
1415800016064 is an abundant number, since it is smaller than the sum of its proper divisors (3472814934144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1415800016064 is a wasteful number, since it uses less digits than its factorization.
1415800016064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3014 (or 2995 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 36.
The spelling of 1415800016064 in words is "one trillion, four hundred fifteen billion, eight hundred million, sixteen thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.865 sec. • engine limits •