Base | Representation |
---|---|
bin | 11000110101000111… |
… | …00110100000111101 |
3 | 1021102000120122002020 |
4 | 30122203212200331 |
5 | 204300043123201 |
6 | 10042433350353 |
7 | 651224614161 |
oct | 143243464075 |
9 | 37360518066 |
10 | 13330442301 |
11 | 5720761670 |
12 | 27004083b9 |
13 | 134599aba7 |
14 | 9065c4ca1 |
15 | 530475a36 |
hex | 31a8e683d |
13330442301 has 16 divisors (see below), whose sum is σ = 19707601728. Its totient is φ = 7946611200.
The previous prime is 13330442297. The next prime is 13330442317. The reversal of 13330442301 is 10324403331.
13330442301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13330442301 - 22 = 13330442297 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13330442371) 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, 3309076 + ... + 3313101.
It is an arithmetic number, because the mean of its divisors is an integer number (1231725108).
Almost surely, 213330442301 is an apocalyptic number.
13330442301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13330442301 is a deficient number, since it is larger than the sum of its proper divisors (6377159427).
13330442301 is a wasteful number, since it uses less digits than its factorization.
13330442301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6622252.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 13330442301 its reverse (10324403331), we get a palindrome (23654845632).
The spelling of 13330442301 in words is "thirteen billion, three hundred thirty million, four hundred forty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •