Base | Representation |
---|---|
bin | 11000101000010011… |
… | …10111100010110101 |
3 | 1021010112110200020110 |
4 | 30110021313202311 |
5 | 204040044024023 |
6 | 10024035253233 |
7 | 645451632441 |
oct | 142411674265 |
9 | 37115420213 |
10 | 13223033013 |
11 | 567606a463 |
12 | 269044a219 |
13 | 1329661ab8 |
14 | 8d6225821 |
15 | 525d0aa93 |
hex | 3142778b5 |
13223033013 has 8 divisors (see below), whose sum is σ = 17919738976. Its totient is φ = 8670841200.
The previous prime is 13223032997. The next prime is 13223033023. The reversal of 13223033013 is 31033032231.
13223033013 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 13223033013 - 24 = 13223032997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13223033023) 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, 36128323 + ... + 36128688.
It is an arithmetic number, because the mean of its divisors is an integer number (2239967372).
Almost surely, 213223033013 is an apocalyptic number.
It is an amenable number.
13223033013 is a deficient number, since it is larger than the sum of its proper divisors (4696705963).
13223033013 is an equidigital number, since it uses as much as digits as its factorization.
13223033013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72257075.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 13223033013 its reverse (31033032231), we get a palindrome (44256065244).
The spelling of 13223033013 in words is "thirteen billion, two hundred twenty-three million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •