Base | Representation |
---|---|
bin | 1100011010000110001000… |
… | …1000001011110111100010 |
3 | 1210022012120122221021210211 |
4 | 3012201202020023313202 |
5 | 3242004230341220101 |
6 | 45003132152244334 |
7 | 2605430636313262 |
oct | 306414210136742 |
9 | 53265518837724 |
10 | 13642462445026 |
11 | 438a810434768 |
12 | 16440010a06aa |
13 | 77c62b8a892c |
14 | 35242790d7a2 |
15 | 189d12299c51 |
hex | c686220bde2 |
13642462445026 has 8 divisors (see below), whose sum is σ = 20495031638364. Its totient is φ = 6810785232240.
The previous prime is 13642462445023. The next prime is 13642462445057. The reversal of 13642462445026 is 62054426424631.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 13485412718001 + 157049727025 = 3672249^2 + 396295^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×136424624450262 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13642462445023) 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 3 ways as a sum of consecutive naturals, for example, 5222993505 + ... + 5222996116.
Almost surely, 213642462445026 is an apocalyptic number.
13642462445026 is a deficient number, since it is larger than the sum of its proper divisors (6852569193338).
13642462445026 is a wasteful number, since it uses less digits than its factorization.
13642462445026 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10445990276.
The product of its (nonzero) digits is 6635520, while the sum is 49.
Adding to 13642462445026 its reverse (62054426424631), we get a palindrome (75696888869657).
The spelling of 13642462445026 in words is "thirteen trillion, six hundred forty-two billion, four hundred sixty-two million, four hundred forty-five thousand, twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •