Base | Representation |
---|---|
bin | 11000101010100100… |
… | …11000101110111010 |
3 | 1021011212020111110222 |
4 | 30111102120232322 |
5 | 204104430341242 |
6 | 10025554540042 |
7 | 646102340204 |
oct | 142522305672 |
9 | 37155214428 |
10 | 13242043322 |
11 | 5685874162 |
12 | 2696897622 |
13 | 13305898c1 |
14 | 8d8973774 |
15 | 5278135d2 |
hex | 315498bba |
13242043322 has 24 divisors (see below), whose sum is σ = 21156092244. Its totient is φ = 6213631424.
The previous prime is 13242043303. The next prime is 13242043327. The reversal of 13242043322 is 22334024231.
13242043322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 13240874761 + 1168561 = 115069^2 + 1081^2 .
It is a super-2 number, since 2×132420433222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13242043291 and 13242043300.
It is not an unprimeable number, because it can be changed into a prime (13242043327) 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 11 ways as a sum of consecutive naturals, for example, 62003 + ... + 174150.
Almost surely, 213242043322 is an apocalyptic number.
13242043322 is a deficient number, since it is larger than the sum of its proper divisors (7914048922).
13242043322 is a wasteful number, since it uses less digits than its factorization.
13242043322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236254 (or 236231 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 26.
Adding to 13242043322 its reverse (22334024231), we get a palindrome (35576067553).
The spelling of 13242043322 in words is "thirteen billion, two hundred forty-two million, forty-three thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •