Base | Representation |
---|---|
bin | 1100000110001110001010… |
… | …0101011101111100100111 |
3 | 1202002120020222011011102211 |
4 | 3001203202211131330213 |
5 | 3220410442134034343 |
6 | 44142223200344251 |
7 | 2541652452304660 |
oct | 301434245357447 |
9 | 52076228134384 |
10 | 13301020221223 |
11 | 4268a27181329 |
12 | 15a99b0915087 |
13 | 756385c84207 |
14 | 33dab685a367 |
15 | 180ecb6bd79d |
hex | c18e295df27 |
13301020221223 has 16 divisors (see below), whose sum is σ = 15601397955840. Its totient is φ = 11104524357696.
The previous prime is 13301020221221. The next prime is 13301020221239. The reversal of 13301020221223 is 32212202010331.
It is not a de Polignac number, because 13301020221223 - 21 = 13301020221221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13301020221194 and 13301020221203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13301020221221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 159286261 + ... + 159369742.
It is an arithmetic number, because the mean of its divisors is an integer number (975087372240).
Almost surely, 213301020221223 is an apocalyptic number.
13301020221223 is a deficient number, since it is larger than the sum of its proper divisors (2300377734617).
13301020221223 is an equidigital number, since it uses as much as digits as its factorization.
13301020221223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318656166.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 13301020221223 its reverse (32212202010331), we get a palindrome (45513222231554).
The spelling of 13301020221223 in words is "thirteen trillion, three hundred one billion, twenty million, two hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •