Base | Representation |
---|---|
bin | 11000101000010101… |
… | …11001011101011001 |
3 | 1021010112222101121000 |
4 | 30110022321131121 |
5 | 204040131144001 |
6 | 10024045135213 |
7 | 645454135536 |
oct | 142412713531 |
9 | 37115871530 |
10 | 13223303001 |
11 | 5676234297 |
12 | 269055a509 |
13 | 132972795c |
14 | 8d6295d8d |
15 | 525d60a86 |
hex | 3142b9759 |
13223303001 has 32 divisors (see below), whose sum is σ = 21026632320. Its totient is φ = 8183296512.
The previous prime is 13223302973. The next prime is 13223303003. The reversal of 13223303001 is 10030332231.
13223303001 is a `hidden beast` number, since 1 + 32 + 2 + 330 + 300 + 1 = 666.
13223303001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-13223303001 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13223303003) 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 31 ways as a sum of consecutive naturals, for example, 163815 + ... + 230828.
It is an arithmetic number, because the mean of its divisors is an integer number (657082260).
Almost surely, 213223303001 is an apocalyptic number.
It is an amenable number.
13223303001 is a deficient number, since it is larger than the sum of its proper divisors (7803329319).
13223303001 is a wasteful number, since it uses less digits than its factorization.
13223303001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394742 (or 394736 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 13223303001 its reverse (10030332231), we get a palindrome (23253635232).
The spelling of 13223303001 in words is "thirteen billion, two hundred twenty-three million, three hundred three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •