Base | Representation |
---|---|
bin | 11000110100000001… |
… | …10110100100101001 |
3 | 1021101101102211111221 |
4 | 30122000312210221 |
5 | 204240230124113 |
6 | 10041510222041 |
7 | 651054314431 |
oct | 143200664451 |
9 | 37341384457 |
10 | 13321333033 |
11 | 57165aa748 |
12 | 26b9354921 |
13 | 1343b2b8a8 |
14 | 9052d32c1 |
15 | 52e77698d |
hex | 31a036929 |
13321333033 has 4 divisors (see below), whose sum is σ = 13321571200. Its totient is φ = 13321094868.
The previous prime is 13321333027. The next prime is 13321333037. The reversal of 13321333033 is 33033312331.
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, and also an emirpimes, since its reverse is a distinct semiprime: 33033312331 = 139 ⋅237649729.
It is a cyclic number.
It is not a de Polignac number, because 13321333033 - 217 = 13321201961 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13321332989 and 13321333007.
It is not an unprimeable number, because it can be changed into a prime (13321333037) 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, 15568 + ... + 163966.
It is an arithmetic number, because the mean of its divisors is an integer number (3330392800).
Almost surely, 213321333033 is an apocalyptic number.
It is an amenable number.
13321333033 is a deficient number, since it is larger than the sum of its proper divisors (238167).
13321333033 is an equidigital number, since it uses as much as digits as its factorization.
13321333033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 238166.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 13321333033 its reverse (33033312331), we get a palindrome (46354645364).
The spelling of 13321333033 in words is "thirteen billion, three hundred twenty-one million, three hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •