Base | Representation |
---|---|
bin | 11000110001011111… |
… | …00110011100100001 |
3 | 1021022220100200210102 |
4 | 30120233212130201 |
5 | 204214302031223 |
6 | 10035425512145 |
7 | 650405263220 |
oct | 143057463441 |
9 | 37286320712 |
10 | 13300033313 |
11 | 5705581976 |
12 | 26b21a2655 |
13 | 133c5b19c8 |
14 | 90254acb7 |
15 | 52c96a928 |
hex | 318be6721 |
13300033313 has 16 divisors (see below), whose sum is σ = 15489127680. Its totient is φ = 11184177600.
The previous prime is 13300033303. The next prime is 13300033319. The reversal of 13300033313 is 31333000331.
13300033313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13300033313 - 28 = 13300033057 is a prime.
It is a super-2 number, since 2×133000333132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13300033319) 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 15 ways as a sum of consecutive naturals, for example, 126068 + ... + 206138.
It is an arithmetic number, because the mean of its divisors is an integer number (968070480).
Almost surely, 213300033313 is an apocalyptic number.
It is an amenable number.
13300033313 is a deficient number, since it is larger than the sum of its proper divisors (2189094367).
13300033313 is an equidigital number, since it uses as much as digits as its factorization.
13300033313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80528.
The product of its (nonzero) digits is 729, while the sum is 20.
Adding to 13300033313 its reverse (31333000331), we get a palindrome (44633033644).
The spelling of 13300033313 in words is "thirteen billion, three hundred million, thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •