Base | Representation |
---|---|
bin | 11001000001011001… |
… | …10110100010000101 |
3 | 1021200012120001111201 |
4 | 30200230312202011 |
5 | 210002440434001 |
6 | 10100555102501 |
7 | 653616060646 |
oct | 144054664205 |
9 | 37605501451 |
10 | 13433530501 |
11 | 5773972326 |
12 | 272aa41a31 |
13 | 1361153221 |
14 | 91617b6cd |
15 | 53953a501 |
hex | 320b36885 |
13433530501 has 2 divisors, whose sum is σ = 13433530502. Its totient is φ = 13433530500.
The previous prime is 13433530469. The next prime is 13433530507. The reversal of 13433530501 is 10503533431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9083996100 + 4349534401 = 95310^2 + 65951^2 .
It is a cyclic number.
It is not a de Polignac number, because 13433530501 - 25 = 13433530469 is a prime.
It is a super-3 number, since 3×134335305013 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 13433530501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13433530507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6716765250 + 6716765251.
It is an arithmetic number, because the mean of its divisors is an integer number (6716765251).
Almost surely, 213433530501 is an apocalyptic number.
It is an amenable number.
13433530501 is a deficient number, since it is larger than the sum of its proper divisors (1).
13433530501 is an equidigital number, since it uses as much as digits as its factorization.
13433530501 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8100, while the sum is 28.
It can be divided in two parts, 134335 and 30501, that added together give a square (164836 = 4062).
The spelling of 13433530501 in words is "thirteen billion, four hundred thirty-three million, five hundred thirty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •