Base | Representation |
---|---|
bin | 11110100101011011010010… |
… | …010000001101110100101100 |
3 | 122122021100101002010111012210 |
4 | 132211123102100031310230 |
5 | 120112331231142224122 |
6 | 1154030321340130420 |
7 | 40222160204244126 |
oct | 3645332220156454 |
9 | 578240332114183 |
10 | 134513313242412 |
11 | 39950859630375 |
12 | 131056b8536a10 |
13 | 5a09721756800 |
14 | 253069c90a216 |
15 | 1083eeed6140c |
hex | 7a56d240dd2c |
134513313242412 has 72 divisors (see below), whose sum is σ = 350828385761280. Its totient is φ = 40053592013760.
The previous prime is 134513313242309. The next prime is 134513313242437. The reversal of 134513313242412 is 214242313315431.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1069744612 + ... + 1069870347.
Almost surely, 2134513313242412 is an apocalyptic number.
134513313242412 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
134513313242412 is an abundant number, since it is smaller than the sum of its proper divisors (216315072518868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134513313242412 is a wasteful number, since it uses less digits than its factorization.
134513313242412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2139615023 (or 2139615008 counting only the distinct ones).
The product of its digits is 207360, while the sum is 39.
Adding to 134513313242412 its reverse (214242313315431), we get a palindrome (348755626557843).
The spelling of 134513313242412 in words is "one hundred thirty-four trillion, five hundred thirteen billion, three hundred thirteen million, two hundred forty-two thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •