Base | Representation |
---|---|
bin | 11110100100110011010100… |
… | …011011100110111110101001 |
3 | 122122010020121101111111222222 |
4 | 132210303110123212332221 |
5 | 120111130334412014010 |
6 | 1153554503214523425 |
7 | 40216110604530314 |
oct | 3644632433467651 |
9 | 578106541444888 |
10 | 134470400110505 |
11 | 399346382541a8 |
12 | 130b9320b06575 |
13 | 5a05672cb6274 |
14 | 252c58b4a997b |
15 | 1082d3c744355 |
hex | 7a4cd46e6fa9 |
134470400110505 has 16 divisors (see below), whose sum is σ = 161460692110224. Its totient is φ = 107512181483520.
The previous prime is 134470400110489. The next prime is 134470400110567. The reversal of 134470400110505 is 505011004074431.
It can be written as a sum of positive squares in 8 ways, for example, as 34295043302809 + 100175356807696 = 5856197^2 + 10008764^2 .
It is not a de Polignac number, because 134470400110505 - 24 = 134470400110489 is a prime.
It is a super-2 number, since 2×1344704001105052 (a number of 29 digits) contains 22 as substring.
It is a Duffinian 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, 475299569 + ... + 475582401.
It is an arithmetic number, because the mean of its divisors is an integer number (10091293256889).
Almost surely, 2134470400110505 is an apocalyptic number.
It is an amenable number.
134470400110505 is a deficient number, since it is larger than the sum of its proper divisors (26990291999719).
134470400110505 is a wasteful number, since it uses less digits than its factorization.
134470400110505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 339196.
The product of its (nonzero) digits is 33600, while the sum is 35.
Adding to 134470400110505 its reverse (505011004074431), we get a palindrome (639481404184936).
The spelling of 134470400110505 in words is "one hundred thirty-four trillion, four hundred seventy billion, four hundred million, one hundred ten thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •