Base | Representation |
---|---|
bin | 11000010000100000… |
… | …00100001011011001 |
3 | 1020121121200202121211 |
4 | 30020100010023121 |
5 | 203132433043113 |
6 | 5552143103121 |
7 | 640505326066 |
oct | 141020041331 |
9 | 36547622554 |
10 | 13023331033 |
11 | 55833703a9 |
12 | 26355a1aa1 |
13 | 12c718034b |
14 | 8b78bdc6d |
15 | 51350eb3d |
hex | 3084042d9 |
13023331033 has 4 divisors (see below), whose sum is σ = 13044370960. Its totient is φ = 13002291108.
The previous prime is 13023330967. The next prime is 13023331051. The reversal of 13023331033 is 33013332031.
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 13023331033 - 213 = 13023322841 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13023330995 and 13023331013.
It is not an unprimeable number, because it can be changed into a prime (13023331093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10519035 + ... + 10520272.
It is an arithmetic number, because the mean of its divisors is an integer number (3261092740).
Almost surely, 213023331033 is an apocalyptic number.
It is an amenable number.
13023331033 is a deficient number, since it is larger than the sum of its proper divisors (21039927).
13023331033 is an equidigital number, since it uses as much as digits as its factorization.
13023331033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21039926.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 13023331033 its reverse (33013332031), we get a palindrome (46036663064).
The spelling of 13023331033 in words is "thirteen billion, twenty-three million, three hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •