Base | Representation |
---|---|
bin | 11000110001101000… |
… | …01000111100110101 |
3 | 1021022222121011001002 |
4 | 30120310020330311 |
5 | 204220103120341 |
6 | 10035511213045 |
7 | 650421350306 |
oct | 143064107465 |
9 | 37288534032 |
10 | 13301223221 |
11 | 5706214970 |
12 | 26b2677185 |
13 | 133c90a4b0 |
14 | 90277a7ad |
15 | 52cb0329b |
hex | 318d08f35 |
13301223221 has 16 divisors (see below), whose sum is σ = 15730124928. Its totient is φ = 11087928000.
The previous prime is 13301223217. The next prime is 13301223223. The reversal of 13301223221 is 12232210331.
It is a cyclic number.
It is not a de Polignac number, because 13301223221 - 22 = 13301223217 is a prime.
It is a super-2 number, since 2×133012232212 (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 = 13301223193 and 13301223202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13301223223) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 286406 + ... + 329591.
It is an arithmetic number, because the mean of its divisors is an integer number (983132808).
Almost surely, 213301223221 is an apocalyptic number.
13301223221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13301223221 is a deficient number, since it is larger than the sum of its proper divisors (2428901707).
13301223221 is a wasteful number, since it uses less digits than its factorization.
13301223221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 616172.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13301223221 its reverse (12232210331), we get a palindrome (25533433552).
The spelling of 13301223221 in words is "thirteen billion, three hundred one million, two hundred twenty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •