Base | Representation |
---|---|
bin | 11000101000000110… |
… | …11010101110101011 |
3 | 1021010102021202202220 |
4 | 30110003122232223 |
5 | 204034130421443 |
6 | 10023535125123 |
7 | 645431360643 |
oct | 142403325653 |
9 | 37112252686 |
10 | 13221342123 |
11 | 5675115030 |
12 | 268b9737a3 |
13 | 13291bc282 |
14 | 8d5d05523 |
15 | 525ac4a83 |
hex | 3140dabab |
13221342123 has 8 divisors (see below), whose sum is σ = 19231043136. Its totient is φ = 8012934600.
The previous prime is 13221342041. The next prime is 13221342133. The reversal of 13221342123 is 32124312231.
13221342123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13221342123 - 29 = 13221341611 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13221342093 and 13221342102.
It is not an unprimeable number, because it can be changed into a prime (13221342133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 200323333 + ... + 200323398.
It is an arithmetic number, because the mean of its divisors is an integer number (2403880392).
Almost surely, 213221342123 is an apocalyptic number.
13221342123 is a deficient number, since it is larger than the sum of its proper divisors (6009701013).
13221342123 is a wasteful number, since it uses less digits than its factorization.
13221342123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400646745.
The product of its digits is 1728, while the sum is 24.
Adding to 13221342123 its reverse (32124312231), we get a palindrome (45345654354).
The spelling of 13221342123 in words is "thirteen billion, two hundred twenty-one million, three hundred forty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •