Base | Representation |
---|---|
bin | 111110110100010111… |
… | …1011101010100010010 |
3 | 110220012111111220221000 |
4 | 1331220233131110102 |
5 | 4202234210214430 |
6 | 141550042042430 |
7 | 12513656524536 |
oct | 1755057352422 |
9 | 426174456830 |
10 | 134901257490 |
11 | 5223627445a |
12 | 2218a1a9416 |
13 | c94b4400ac |
14 | 675a3c5bc6 |
15 | 37982b2e60 |
hex | 1f68bdd512 |
134901257490 has 64 divisors (see below), whose sum is σ = 361746518400. Its totient is φ = 35772685632.
The previous prime is 134901257453. The next prime is 134901257501. The reversal of 134901257490 is 94752109431.
134901257490 is a `hidden beast` number, since 1 + 3 + 490 + 1 + 2 + 5 + 74 + 90 = 666.
It is a super-2 number, since 2×1349012574902 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1347297 + ... + 1443956.
It is an arithmetic number, because the mean of its divisors is an integer number (5652289350).
Almost surely, 2134901257490 is an apocalyptic number.
134901257490 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
134901257490 is an abundant number, since it is smaller than the sum of its proper divisors (226845260910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134901257490 is a wasteful number, since it uses less digits than its factorization.
134901257490 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2791448 (or 2791442 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The spelling of 134901257490 in words is "one hundred thirty-four billion, nine hundred one million, two hundred fifty-seven thousand, four hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •