Base | Representation |
---|---|
bin | 11001011011111011… |
… | …11110001010111011 |
3 | 1022020201101212200220 |
4 | 30231331332022323 |
5 | 210431431401133 |
6 | 10135030031123 |
7 | 662261056614 |
oct | 145575761273 |
9 | 38221355626 |
10 | 13656122043 |
11 | 5878585683 |
12 | 27914a84a3 |
13 | 13982ba3b5 |
14 | 937960c0b |
15 | 54dd585b3 |
hex | 32df7e2bb |
13656122043 has 4 divisors (see below), whose sum is σ = 18208162728. Its totient is φ = 9104081360.
The previous prime is 13656122041. The next prime is 13656122059. The reversal of 13656122043 is 34022165631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 34022165631 = 3 ⋅11340721877.
It is a cyclic number.
It is not a de Polignac number, because 13656122043 - 21 = 13656122041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13656121995 and 13656122013.
It is not an unprimeable number, because it can be changed into a prime (13656122041) 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 3 ways as a sum of consecutive naturals, for example, 2276020338 + ... + 2276020343.
It is an arithmetic number, because the mean of its divisors is an integer number (4552040682).
Almost surely, 213656122043 is an apocalyptic number.
13656122043 is a deficient number, since it is larger than the sum of its proper divisors (4552040685).
13656122043 is an equidigital number, since it uses as much as digits as its factorization.
13656122043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4552040684.
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 13656122043 its reverse (34022165631), we get a palindrome (47678287674).
The spelling of 13656122043 in words is "thirteen billion, six hundred fifty-six million, one hundred twenty-two thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •