Base | Representation |
---|---|
bin | 1011111100111110101000… |
… | …1000110011100001110101 |
3 | 1201112101101211020102122120 |
4 | 2333033222020303201311 |
5 | 3210310243140311341 |
6 | 43541243014150153 |
7 | 2524331534324121 |
oct | 277175210634165 |
9 | 51471354212576 |
10 | 13142233135221 |
11 | 4207653a95433 |
12 | 1583077352359 |
13 | 7443cc0b0aa8 |
14 | 336132078581 |
15 | 17bcd646d066 |
hex | bf3ea233875 |
13142233135221 has 8 divisors (see below), whose sum is σ = 17523104522784. Its totient is φ = 8761425252240.
The previous prime is 13142233135211. The next prime is 13142233135309. The reversal of 13142233135221 is 12253133224131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13142233135221 - 27 = 13142233135093 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13142233135211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15391146 + ... + 16222571.
It is an arithmetic number, because the mean of its divisors is an integer number (2190388065348).
Almost surely, 213142233135221 is an apocalyptic number.
It is an amenable number.
13142233135221 is a deficient number, since it is larger than the sum of its proper divisors (4380871387563).
13142233135221 is a wasteful number, since it uses less digits than its factorization.
13142233135221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31752291.
The product of its digits is 25920, while the sum is 33.
Adding to 13142233135221 its reverse (12253133224131), we get a palindrome (25395366359352).
It can be divided in two parts, 1314223 and 3135221, that added together give a palindrome (4449444).
The spelling of 13142233135221 in words is "thirteen trillion, one hundred forty-two billion, two hundred thirty-three million, one hundred thirty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •