Base | Representation |
---|---|
bin | 11111000001010100111101… |
… | …001011111111110010010001 |
3 | 122220001122101110102101122002 |
4 | 133001110331023333302101 |
5 | 120340234444123244330 |
6 | 1202055214201323345 |
7 | 40510535001654062 |
oct | 3701247513776221 |
9 | 586048343371562 |
10 | 136430662712465 |
11 | 3a51aa123a7760 |
12 | 13375214a96555 |
13 | 5b18482a00754 |
14 | 25993ca5c8569 |
15 | 10b8d1bd0ce45 |
hex | 7c153d2ffc91 |
136430662712465 has 64 divisors (see below), whose sum is σ = 186907199431680. Its totient is φ = 94709395722240.
The previous prime is 136430662712431. The next prime is 136430662712473. The reversal of 136430662712465 is 564217266034631.
It is not a de Polignac number, because 136430662712465 - 212 = 136430662708369 is a prime.
It is a super-2 number, since 2×1364306627124652 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 136430662712465.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1147409897 + ... + 1147528793.
It is an arithmetic number, because the mean of its divisors is an integer number (2920424991120).
Almost surely, 2136430662712465 is an apocalyptic number.
It is an amenable number.
136430662712465 is a deficient number, since it is larger than the sum of its proper divisors (50476536719215).
136430662712465 is a wasteful number, since it uses less digits than its factorization.
136430662712465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129642.
The product of its (nonzero) digits is 26127360, while the sum is 56.
The spelling of 136430662712465 in words is "one hundred thirty-six trillion, four hundred thirty billion, six hundred sixty-two million, seven hundred twelve thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •