Base | Representation |
---|---|
bin | 11000110110010111… |
… | …11101111100100001 |
3 | 1021102202111020111020 |
4 | 30123023331330201 |
5 | 204310300232113 |
6 | 10043452240053 |
7 | 651413555541 |
oct | 143313757441 |
9 | 37382436436 |
10 | 13341024033 |
11 | 57267298a7 |
12 | 2703a70029 |
13 | 1347c3447c |
14 | 907b7b321 |
15 | 531366023 |
hex | 31b2fdf21 |
13341024033 has 4 divisors (see below), whose sum is σ = 17788032048. Its totient is φ = 8894016020.
The previous prime is 13341024017. The next prime is 13341024049. The reversal of 13341024033 is 33042014331.
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 an interprime number because it is at equal distance from previous prime (13341024017) and next prime (13341024049).
It is a cyclic number.
It is not a de Polignac number, because 13341024033 - 24 = 13341024017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13341023994 and 13341024012.
It is not an unprimeable number, because it can be changed into a prime (13341024013) 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, 2223504003 + ... + 2223504008.
It is an arithmetic number, because the mean of its divisors is an integer number (4447008012).
Almost surely, 213341024033 is an apocalyptic number.
It is an amenable number.
13341024033 is a deficient number, since it is larger than the sum of its proper divisors (4447008015).
13341024033 is an equidigital number, since it uses as much as digits as its factorization.
13341024033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4447008014.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 13341024033 its reverse (33042014331), we get a palindrome (46383038364).
The spelling of 13341024033 in words is "thirteen billion, three hundred forty-one million, twenty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •