Base | Representation |
---|---|
bin | 11000111000111100… |
… | …10110101100100111 |
3 | 1021111021010111021011 |
4 | 30130132112230213 |
5 | 204331312334343 |
6 | 10045543203051 |
7 | 652065256240 |
oct | 143436265447 |
9 | 37437114234 |
10 | 13362621223 |
11 | 5737940116 |
12 | 270b146487 |
13 | 134c556883 |
14 | 90a99dcc7 |
15 | 5331d029d |
hex | 31c796b27 |
13362621223 has 8 divisors (see below), whose sum is σ = 15279761792. Its totient is φ = 11447529336.
The previous prime is 13362621199. The next prime is 13362621263. The reversal of 13362621223 is 32212626331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13362621223 - 25 = 13362621191 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13362621263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 498165 + ... + 524302.
It is an arithmetic number, because the mean of its divisors is an integer number (1909970224).
Almost surely, 213362621223 is an apocalyptic number.
13362621223 is a deficient number, since it is larger than the sum of its proper divisors (1917140569).
13362621223 is a wasteful number, since it uses less digits than its factorization.
13362621223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1024341.
The product of its digits is 15552, while the sum is 31.
The spelling of 13362621223 in words is "thirteen billion, three hundred sixty-two million, six hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.191 sec. • engine limits •