Base | Representation |
---|---|
bin | 11000001111010101… |
… | …11100100001001101 |
3 | 1020120221101101121112 |
4 | 30013222330201031 |
5 | 203122440202313 |
6 | 5551154341405 |
7 | 640326530516 |
oct | 140752744115 |
9 | 36527341545 |
10 | 13013600333 |
11 | 55789245a8 |
12 | 263228a865 |
13 | 12c5154236 |
14 | 8b64a9a0d |
15 | 51273b8a8 |
hex | 307abc84d |
13013600333 has 8 divisors (see below), whose sum is σ = 13086097728. Its totient is φ = 12941155584.
The previous prime is 13013600207. The next prime is 13013600359. The reversal of 13013600333 is 33300631031.
13013600333 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 a cyclic number.
It is not a de Polignac number, because 13013600333 - 210 = 13013599309 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13013600299 and 13013600308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13013600363) 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, 548666 + ... + 571892.
It is an arithmetic number, because the mean of its divisors is an integer number (1635762216).
Almost surely, 213013600333 is an apocalyptic number.
It is an amenable number.
13013600333 is a deficient number, since it is larger than the sum of its proper divisors (72497395).
13013600333 is a wasteful number, since it uses less digits than its factorization.
13013600333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26323.
The product of its (nonzero) digits is 1458, while the sum is 23.
The spelling of 13013600333 in words is "thirteen billion, thirteen million, six hundred thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •