Base | Representation |
---|---|
bin | 1011111100011001010101… |
… | …1011110100110110110010 |
3 | 1201111102120010202100012112 |
4 | 2333012111123310312302 |
5 | 3210124242330422232 |
6 | 43532505355325322 |
7 | 2523525464166632 |
oct | 277062533646662 |
9 | 51442503670175 |
10 | 13132222123442 |
11 | 420338703a084 |
12 | 1581142750842 |
13 | 743495039396 |
14 | 33586268a6c2 |
15 | 17b8ec6374b2 |
hex | bf1956f4db2 |
13132222123442 has 8 divisors (see below), whose sum is σ = 20069999849196. Its totient is φ = 6442222173712.
The previous prime is 13132222123441. The next prime is 13132222123487. The reversal of 13132222123442 is 24432122223131.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 12997041629881 + 135180493561 = 3605141^2 + 367669^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×131322221234422 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13132222123399 and 13132222123408.
It is not an unprimeable number, because it can be changed into a prime (13132222123441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 61944443873 + ... + 61944444084.
Almost surely, 213132222123442 is an apocalyptic number.
13132222123442 is a deficient number, since it is larger than the sum of its proper divisors (6937777725754).
13132222123442 is a wasteful number, since it uses less digits than its factorization.
13132222123442 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123888888012.
The product of its digits is 27648, while the sum is 32.
Adding to 13132222123442 its reverse (24432122223131), we get a palindrome (37564344346573).
The spelling of 13132222123442 in words is "thirteen trillion, one hundred thirty-two billion, two hundred twenty-two million, one hundred twenty-three thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •