Base | Representation |
---|---|
bin | 11001001111111010… |
… | …00001011100110001 |
3 | 1021222200112000110001 |
4 | 30213331001130301 |
5 | 210230113210113 |
6 | 10121023110001 |
7 | 656624245531 |
oct | 144775013461 |
9 | 37880460401 |
10 | 13555210033 |
11 | 5826620a22 |
12 | 2763742301 |
13 | 1380417751 |
14 | 9283b34c1 |
15 | 5450737dd |
hex | 327f41731 |
13555210033 has 4 divisors (see below), whose sum is σ = 14268642160. Its totient is φ = 12841777908.
The previous prime is 13555210013. The next prime is 13555210051. The reversal of 13555210033 is 33001255531.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13555210033 - 229 = 13018339121 is a prime.
It is a super-2 number, since 2×135552100332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13555209983 and 13555210010.
It is not an unprimeable number, because it can be changed into a prime (13555210013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 356716035 + ... + 356716072.
It is an arithmetic number, because the mean of its divisors is an integer number (3567160540).
Almost surely, 213555210033 is an apocalyptic number.
It is an amenable number.
13555210033 is a deficient number, since it is larger than the sum of its proper divisors (713432127).
13555210033 is an equidigital number, since it uses as much as digits as its factorization.
13555210033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 713432126.
The product of its (nonzero) digits is 6750, while the sum is 28.
Adding to 13555210033 its reverse (33001255531), we get a palindrome (46556465564).
The spelling of 13555210033 in words is "thirteen billion, five hundred fifty-five million, two hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •