Base | Representation |
---|---|
bin | 111110100010110100… |
… | …1110001001000000000 |
3 | 110211200110210011011210 |
4 | 1331011221301020000 |
5 | 4200033004010300 |
6 | 141411412210120 |
7 | 12463250643624 |
oct | 1750551611000 |
9 | 424613704153 |
10 | 134312563200 |
11 | 51a63a38752 |
12 | 22045009940 |
13 | c8864a248a |
14 | 6702143184 |
15 | 376177a050 |
hex | 1f45a71200 |
134312563200 has 480 divisors, whose sum is σ = 453799329984. Its totient is φ = 35011952640.
The previous prime is 134312563193. The next prime is 134312563243. The reversal of 134312563200 is 2365213431.
It is a tau number, because it is divible by the number of its divisors (480).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 398553432 + ... + 398553768.
Almost surely, 2134312563200 is an apocalyptic number.
134312563200 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 134312563200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (226899664992).
134312563200 is an abundant number, since it is smaller than the sum of its proper divisors (319486766784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134312563200 is a wasteful number, since it uses less digits than its factorization.
134312563200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 572 (or 551 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 134312563200 its reverse (2365213431), we get a palindrome (136677776631).
The spelling of 134312563200 in words is "one hundred thirty-four billion, three hundred twelve million, five hundred sixty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •