Base | Representation |
---|---|
bin | 11110100101100001111110… |
… | …101111101110101101000000 |
3 | 122122022000221002022221020110 |
4 | 132211201332233232231000 |
5 | 120112440442022331000 |
6 | 1154033510543311320 |
7 | 40222533306050166 |
oct | 3645417657565500 |
9 | 578260832287213 |
10 | 134520502152000 |
11 | 39953908582568 |
12 | 13106b83bab540 |
13 | 5a0a2c8c32a73 |
14 | 2530b8159d236 |
15 | 10842c1043850 |
hex | 7a587ebeeb40 |
134520502152000 has 112 divisors (see below), whose sum is σ = 444186698185152. Its totient is φ = 35872133900800.
The previous prime is 134520502151983. The next prime is 134520502152031. The reversal of 134520502152000 is 251205025431.
It is a super-2 number, since 2×1345205021520002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2802486462 + ... + 2802534461.
Almost surely, 2134520502152000 is an apocalyptic number.
134520502152000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
134520502152000 is an abundant number, since it is smaller than the sum of its proper divisors (309666196033152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134520502152000 is an equidigital number, since it uses as much as digits as its factorization.
134520502152000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5605020953 (or 5605020933 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 134520502152000 its reverse (251205025431), we get a palindrome (134771707177431).
The spelling of 134520502152000 in words is "one hundred thirty-four trillion, five hundred twenty billion, five hundred two million, one hundred fifty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •