Base | Representation |
---|---|
bin | 111111100001101111… |
… | …0111001010111101101 |
3 | 111001010121011002200220 |
4 | 1333003132321113231 |
5 | 4213343423030410 |
6 | 142401104041553 |
7 | 12566463554235 |
oct | 1770336712755 |
9 | 431117132626 |
10 | 136423642605 |
11 | 52947653978 |
12 | 225340032b9 |
13 | cb3196c2a3 |
14 | 6862674cc5 |
15 | 3836c80070 |
hex | 1fc37b95ed |
136423642605 has 32 divisors (see below), whose sum is σ = 221492517120. Its totient is φ = 71689013760.
The previous prime is 136423642591. The next prime is 136423642651. The reversal of 136423642605 is 506246324631.
It is a happy number.
It is not a de Polignac number, because 136423642605 - 26 = 136423642541 is a prime.
It is a super-2 number, since 2×1364236426052 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
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, 1673779 + ... + 1753391.
It is an arithmetic number, because the mean of its divisors is an integer number (6921641160).
Almost surely, 2136423642605 is an apocalyptic number.
136423642605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
136423642605 is a deficient number, since it is larger than the sum of its proper divisors (85068874515).
136423642605 is a wasteful number, since it uses less digits than its factorization.
136423642605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81301.
The product of its (nonzero) digits is 622080, while the sum is 42.
The spelling of 136423642605 in words is "one hundred thirty-six billion, four hundred twenty-three million, six hundred forty-two thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •