Base | Representation |
---|---|
bin | 11001000001100110… |
… | …10011100001100001 |
3 | 1021200022201222222000 |
4 | 30200303103201201 |
5 | 210003404101423 |
6 | 10101055234213 |
7 | 653636334525 |
oct | 144063234141 |
9 | 37608658860 |
10 | 13435222113 |
11 | 5774918255 |
12 | 272b518969 |
13 | 13615c6191 |
14 | 91649bd85 |
15 | 539771843 |
hex | 320cd3861 |
13435222113 has 8 divisors (see below), whose sum is σ = 19904032800. Its totient is φ = 8956814724.
The previous prime is 13435222027. The next prime is 13435222193. The reversal of 13435222113 is 31122253431.
13435222113 is a `hidden beast` number, since 1 + 3 + 435 + 2 + 221 + 1 + 3 = 666.
It is not a de Polignac number, because 13435222113 - 28 = 13435221857 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 497600819 = 13435222113 / (1 + 3 + 4 + 3 + 5 + 2 + 2 + 2 + 1 + 1 + 3).
It is not an unprimeable number, because it can be changed into a prime (13435222193) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 248800383 + ... + 248800436.
It is an arithmetic number, because the mean of its divisors is an integer number (2488004100).
Almost surely, 213435222113 is an apocalyptic number.
It is an amenable number.
13435222113 is a deficient number, since it is larger than the sum of its proper divisors (6468810687).
13435222113 is an equidigital number, since it uses as much as digits as its factorization.
13435222113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 497600828 (or 497600822 counting only the distinct ones).
The product of its digits is 4320, while the sum is 27.
Adding to 13435222113 its reverse (31122253431), we get a palindrome (44557475544).
The spelling of 13435222113 in words is "thirteen billion, four hundred thirty-five million, two hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •