Base | Representation |
---|---|
bin | 100001101011000101… |
… | …110100100011010101 |
3 | 10110022210200202210200 |
4 | 201223011310203111 |
5 | 1043022021121303 |
6 | 24335433411113 |
7 | 2416663361010 |
oct | 415305644325 |
9 | 113283622720 |
10 | 36156426453 |
11 | 143743a6384 |
12 | 7010869a99 |
13 | 354299cba4 |
14 | 1a6dd36377 |
15 | e193603a3 |
hex | 86b1748d5 |
36156426453 has 48 divisors (see below), whose sum is σ = 60611556096. Its totient is φ = 20341520640.
The previous prime is 36156426451. The next prime is 36156426473. The reversal of 36156426453 is 35462465163.
36156426453 is a `hidden beast` number, since 3 + 6 + 156 + 42 + 6 + 453 = 666.
It is not a de Polignac number, because 36156426453 - 21 = 36156426451 is a prime.
It is a super-2 number, since 2×361564264532 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 36156426399 and 36156426408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36156426451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3452401 + ... + 3462857.
It is an arithmetic number, because the mean of its divisors is an integer number (1262740752).
Almost surely, 236156426453 is an apocalyptic number.
It is an amenable number.
36156426453 is a deficient number, since it is larger than the sum of its proper divisors (24455129643).
36156426453 is a wasteful number, since it uses less digits than its factorization.
36156426453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11314 (or 11311 counting only the distinct ones).
The product of its digits is 1555200, while the sum is 45.
The spelling of 36156426453 in words is "thirty-six billion, one hundred fifty-six million, four hundred twenty-six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •