Base | Representation |
---|---|
bin | 1011111100111010111001… |
… | …1001111101101101100110 |
3 | 1201112021210222112201010220 |
4 | 2333032232121331231212 |
5 | 3210301220114003142 |
6 | 43540555335025210 |
7 | 2524264645322250 |
oct | 277165631755546 |
9 | 51467728481126 |
10 | 13141231000422 |
11 | 420718a343758 |
12 | 1582a3780b206 |
13 | 74429c5a7015 |
14 | 336078d32cd0 |
15 | 17bc784b92ec |
hex | bf3ae67db66 |
13141231000422 has 16 divisors (see below), whose sum is σ = 30037099429632. Its totient is φ = 3754637428680.
The previous prime is 13141231000421. The next prime is 13141231000451. The reversal of 13141231000422 is 22400013214131.
It is a junction number, because it is equal to n+sod(n) for n = 13141231000392 and 13141231000401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13141231000421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 156443226154 + ... + 156443226237.
It is an arithmetic number, because the mean of its divisors is an integer number (1877318714352).
Almost surely, 213141231000422 is an apocalyptic number.
13141231000422 is an abundant number, since it is smaller than the sum of its proper divisors (16895868429210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13141231000422 is a wasteful number, since it uses less digits than its factorization.
13141231000422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312886452403.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 13141231000422 its reverse (22400013214131), we get a palindrome (35541244214553).
The spelling of 13141231000422 in words is "thirteen trillion, one hundred forty-one billion, two hundred thirty-one million, four hundred twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •