Base | Representation |
---|---|
bin | 11000011101100100… |
… | …11110010110100001 |
3 | 1020220021002020221222 |
4 | 30032302132112201 |
5 | 203344022430213 |
6 | 10011102024425 |
7 | 643306531550 |
oct | 141662362641 |
9 | 36807066858 |
10 | 13133014433 |
11 | 562a276140 |
12 | 2666278115 |
13 | 1313b04576 |
14 | 8c82b1d97 |
15 | 51ce78808 |
hex | 30ec9e5a1 |
13133014433 has 32 divisors (see below), whose sum is σ = 16744624128. Its totient is φ = 10002240000.
The previous prime is 13133014429. The next prime is 13133014457. The reversal of 13133014433 is 33441033131.
13133014433 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 13133014433 - 22 = 13133014429 is a prime.
It is a super-2 number, since 2×131330144332 (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 (13133014333) 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, 3280433 + ... + 3284433.
It is an arithmetic number, because the mean of its divisors is an integer number (523269504).
Almost surely, 213133014433 is an apocalyptic number.
It is an amenable number.
13133014433 is a deficient number, since it is larger than the sum of its proper divisors (3611609695).
13133014433 is a wasteful number, since it uses less digits than its factorization.
13133014433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4973.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 13133014433 its reverse (33441033131), we get a palindrome (46574047564).
The spelling of 13133014433 in words is "thirteen billion, one hundred thirty-three million, fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •