Base | Representation |
---|---|
bin | 1011111100010101001010… |
… | …1000010001000000101110 |
3 | 1201111022200000202011121102 |
4 | 2333011102220101000232 |
5 | 3210114443413423042 |
6 | 43532202240403102 |
7 | 2523455634352142 |
oct | 277052250210056 |
9 | 51438600664542 |
10 | 13131101311022 |
11 | 42029613aa122 |
12 | 1580a8b316492 |
13 | 743346a7c576 |
14 | 335797891222 |
15 | 17b88403eb32 |
hex | bf152a1102e |
13131101311022 has 4 divisors (see below), whose sum is σ = 19696651966536. Its totient is φ = 6565550655510.
The previous prime is 13131101311007. The next prime is 13131101311037. The reversal of 13131101311022 is 22011310113131.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (13131101311007) and next prime (13131101311037).
It is a junction number, because it is equal to n+sod(n) for n = 13131101310985 and 13131101311003.
It is a congruent number.
It is an unprimeable number.
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, 3282775327754 + ... + 3282775327757.
It is an arithmetic number, because the mean of its divisors is an integer number (4924162991634).
Almost surely, 213131101311022 is an apocalyptic number.
13131101311022 is a deficient number, since it is larger than the sum of its proper divisors (6565550655514).
13131101311022 is an equidigital number, since it uses as much as digits as its factorization.
13131101311022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6565550655513.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 13131101311022 its reverse (22011310113131), we get a palindrome (35142411424153).
The spelling of 13131101311022 in words is "thirteen trillion, one hundred thirty-one billion, one hundred one million, three hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •