Base | Representation |
---|---|
bin | 10101010110000000100… |
… | …011111010110010001000 |
3 | 12012012220200111001022012 |
4 | 111112000203322302020 |
5 | 143012341112404100 |
6 | 3041451132315052 |
7 | 210653126434355 |
oct | 25260043726210 |
9 | 5165820431265 |
10 | 1466740747400 |
11 | 51604aa06675 |
12 | 1b8320612a88 |
13 | a840ba37c96 |
14 | 50dc241162c |
15 | 2824756b135 |
hex | 155808fac88 |
1466740747400 has 48 divisors (see below), whose sum is σ = 3412559307300. Its totient is φ = 586285620480.
The previous prime is 1466740747387. The next prime is 1466740747403. The reversal of 1466740747400 is 47470476641.
It can be written as a sum of positive squares in 6 ways, for example, as 599983471396 + 866757276004 = 774586^2 + 930998^2 .
It is a Harshad number since it is a multiple of its sum of digits (50).
It is not an unprimeable number, because it can be changed into a prime (1466740747403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2280227 + ... + 2851826.
Almost surely, 21466740747400 is an apocalyptic number.
1466740747400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1466740747400 is an abundant number, since it is smaller than the sum of its proper divisors (1945818559900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1466740747400 is a wasteful number, since it uses less digits than its factorization.
1466740747400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5133498 (or 5133489 counting only the distinct ones).
The product of its (nonzero) digits is 3161088, while the sum is 50.
The spelling of 1466740747400 in words is "one trillion, four hundred sixty-six billion, seven hundred forty million, seven hundred forty-seven thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •