Base | Representation |
---|---|
bin | 11000101000010011… |
… | …10111000011111001 |
3 | 1021010112110120112010 |
4 | 30110021313003321 |
5 | 204040043443113 |
6 | 10024035240133 |
7 | 645451623612 |
oct | 142411670371 |
9 | 37115416463 |
10 | 13223031033 |
11 | 5676068a23 |
12 | 2690449049 |
13 | 1329660c24 |
14 | 8d6224c09 |
15 | 525d0a1c3 |
hex | 3142770f9 |
13223031033 has 8 divisors (see below), whose sum is σ = 17633612896. Its totient is φ = 8813901600.
The previous prime is 13223031013. The next prime is 13223031043. The reversal of 13223031033 is 33013032231.
13223031033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13223031033 - 232 = 8928063737 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (13223031013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 341683 + ... + 378408.
It is an arithmetic number, because the mean of its divisors is an integer number (2204201612).
Almost surely, 213223031033 is an apocalyptic number.
It is an amenable number.
13223031033 is a deficient number, since it is larger than the sum of its proper divisors (4410581863).
13223031033 is an equidigital number, since it uses as much as digits as its factorization.
13223031033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 726215.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 13223031033 its reverse (33013032231), we get a palindrome (46236063264).
The spelling of 13223031033 in words is "thirteen billion, two hundred twenty-three million, thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •