Base | Representation |
---|---|
bin | 111111010110100000… |
… | …0101010110101111111 |
3 | 111000011022201100221212 |
4 | 1332231000222311333 |
5 | 4212110413320111 |
6 | 142255435115035 |
7 | 12554235122120 |
oct | 1765500526577 |
9 | 430138640855 |
10 | 136046620031 |
11 | 52773852273 |
12 | 224498a2a7b |
13 | caa18143ca |
14 | 6828572047 |
15 | 3813b0998b |
hex | 1fad02ad7f |
136046620031 has 16 divisors (see below), whose sum is σ = 156423646464. Its totient is φ = 115906097664.
The previous prime is 136046620019. The next prime is 136046620063. The reversal of 136046620031 is 130026640631.
It is not a de Polignac number, because 136046620031 - 226 = 135979511167 is a prime.
It is a super-2 number, since 2×1360466200312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 136046620031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136046620081) 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, 1527920 + ... + 1614506.
It is an arithmetic number, because the mean of its divisors is an integer number (9776477904).
Almost surely, 2136046620031 is an apocalyptic number.
136046620031 is a deficient number, since it is larger than the sum of its proper divisors (20377026433).
136046620031 is a wasteful number, since it uses less digits than its factorization.
136046620031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87950.
The product of its (nonzero) digits is 15552, while the sum is 32.
The spelling of 136046620031 in words is "one hundred thirty-six billion, forty-six million, six hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •