Base | Representation |
---|---|
bin | 11101110010100111001101… |
… | …010100010000000001000010 |
3 | 122011220112012011201011212022 |
4 | 131302213031110100001002 |
5 | 114133123333013032432 |
6 | 1142354224344201442 |
7 | 36411661656365522 |
oct | 3562471524200102 |
9 | 564815164634768 |
10 | 131021422002242 |
11 | 38824966aa9502 |
12 | 128409b5169282 |
13 | 5815361a0b9a5 |
14 | 244d6836c9682 |
15 | 102327b819b12 |
hex | 7729cd510042 |
131021422002242 has 4 divisors (see below), whose sum is σ = 196532133003366. Its totient is φ = 65510711001120.
The previous prime is 131021422002241. The next prime is 131021422002253. The reversal of 131021422002242 is 242200224120131.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 122488427367601 + 8532994634641 = 11067449^2 + 2921129^2 .
It is a super-2 number, since 2×1310214220022422 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131021422002241) 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 as a sum of consecutive naturals, namely, 32755355500559 + ... + 32755355500562.
Almost surely, 2131021422002242 is an apocalyptic number.
131021422002242 is a deficient number, since it is larger than the sum of its proper divisors (65510711001124).
131021422002242 is an equidigital number, since it uses as much as digits as its factorization.
131021422002242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65510711001123.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 131021422002242 its reverse (242200224120131), we get a palindrome (373221646122373).
The spelling of 131021422002242 in words is "one hundred thirty-one trillion, twenty-one billion, four hundred twenty-two million, two thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.259 sec. • engine limits •