Base | Representation |
---|---|
bin | 111110100110011100… |
… | …1111010001101111100 |
3 | 110211222221201201212101 |
4 | 1331030321322031330 |
5 | 4200310131012020 |
6 | 141431440114444 |
7 | 12466256100643 |
oct | 1751471721574 |
9 | 424887651771 |
10 | 134434235260 |
11 | 52016691776 |
12 | 22079905a24 |
13 | c8a5763490 |
14 | 671437635a |
15 | 376c2b100a |
hex | 1f4ce7a37c |
134434235260 has 48 divisors (see below), whose sum is σ = 305300419200. Its totient is φ = 49429545984.
The previous prime is 134434235249. The next prime is 134434235261. The reversal of 134434235260 is 62532434431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134434235261) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1019565 + ... + 1143844.
It is an arithmetic number, because the mean of its divisors is an integer number (6360425400).
Almost surely, 2134434235260 is an apocalyptic number.
134434235260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
134434235260 is an abundant number, since it is smaller than the sum of its proper divisors (170866183940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134434235260 is a wasteful number, since it uses less digits than its factorization.
134434235260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2163670 (or 2163668 counting only the distinct ones).
The product of its (nonzero) digits is 207360, while the sum is 37.
Adding to 134434235260 its reverse (62532434431), we get a palindrome (196966669691).
The spelling of 134434235260 in words is "one hundred thirty-four billion, four hundred thirty-four million, two hundred thirty-five thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •