Base | Representation |
---|---|
bin | 111111011110011011… |
… | …1100111011000100111 |
3 | 111000211212100201101201 |
4 | 1332330313213120213 |
5 | 4213132021311043 |
6 | 142342101503331 |
7 | 12563645452060 |
oct | 1767467473047 |
9 | 430755321351 |
10 | 136312682023 |
11 | 5289aa56611 |
12 | 22502a11b47 |
13 | cb1498b93b |
14 | 6851a2d567 |
15 | 382c162c4d |
hex | 1fbcde7627 |
136312682023 has 4 divisors (see below), whose sum is σ = 155785922320. Its totient is φ = 116839441728.
The previous prime is 136312681997. The next prime is 136312682029. The reversal of 136312682023 is 320286213631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320286213631 = 1409 ⋅227314559.
It is a cyclic number.
It is not a de Polignac number, because 136312682023 - 213 = 136312673831 is a prime.
It is a super-2 number, since 2×1363126820232 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136312682029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9736620138 + ... + 9736620151.
It is an arithmetic number, because the mean of its divisors is an integer number (38946480580).
Almost surely, 2136312682023 is an apocalyptic number.
136312682023 is a deficient number, since it is larger than the sum of its proper divisors (19473240297).
136312682023 is an equidigital number, since it uses as much as digits as its factorization.
136312682023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19473240296.
The product of its (nonzero) digits is 62208, while the sum is 37.
Adding to 136312682023 its reverse (320286213631), we get a palindrome (456598895654).
The spelling of 136312682023 in words is "one hundred thirty-six billion, three hundred twelve million, six hundred eighty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •