Base | Representation |
---|---|
bin | 11000110110100111… |
… | …01011011100111001 |
3 | 1021102220021221022220 |
4 | 30123103223130321 |
5 | 204311304423213 |
6 | 10044003434253 |
7 | 651440005044 |
oct | 143323533471 |
9 | 37386257286 |
10 | 13343045433 |
11 | 572788a583 |
12 | 2704685989 |
13 | 1348491573 |
14 | 908145c5b |
15 | 531614e23 |
hex | 31b4eb739 |
13343045433 has 4 divisors (see below), whose sum is σ = 17790727248. Its totient is φ = 8895363620.
The previous prime is 13343045399. The next prime is 13343045437. The reversal of 13343045433 is 33454034331.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13343045433 - 29 = 13343044921 is a prime.
It is a super-2 number, since 2×133430454332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13343045394 and 13343045403.
It is not an unprimeable number, because it can be changed into a prime (13343045437) 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, 2223840903 + ... + 2223840908.
It is an arithmetic number, because the mean of its divisors is an integer number (4447681812).
Almost surely, 213343045433 is an apocalyptic number.
It is an amenable number.
13343045433 is a deficient number, since it is larger than the sum of its proper divisors (4447681815).
13343045433 is an equidigital number, since it uses as much as digits as its factorization.
13343045433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4447681814.
The product of its (nonzero) digits is 77760, while the sum is 33.
Adding to 13343045433 its reverse (33454034331), we get a palindrome (46797079764).
The spelling of 13343045433 in words is "thirteen billion, three hundred forty-three million, forty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •