Base | Representation |
---|---|
bin | 11100000011111001100101… |
… | …111111000101100111000011 |
3 | 121011222012022011101202100201 |
4 | 130003321211333011213003 |
5 | 112134000420114221011 |
6 | 1114251142110030031 |
7 | 34665213440535244 |
oct | 3403714577054703 |
9 | 534865264352321 |
10 | 123413301320131 |
11 | 36361318242a39 |
12 | 11a123a8aa8317 |
13 | 53b2a9420a524 |
14 | 22693428ccccb |
15 | e403e33b4cc1 |
hex | 703e65fc59c3 |
123413301320131 has 2 divisors, whose sum is σ = 123413301320132. Its totient is φ = 123413301320130.
The previous prime is 123413301320117. The next prime is 123413301320171. The reversal of 123413301320131 is 131023103314321.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 123413301320131 - 27 = 123413301320003 is a prime.
It is a super-2 number, since 2×1234133013201312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 123413301320131.
It is not a weakly prime, because it can be changed into another prime (123413301320171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61706650660065 + 61706650660066.
It is an arithmetic number, because the mean of its divisors is an integer number (61706650660066).
Almost surely, 2123413301320131 is an apocalyptic number.
123413301320131 is a deficient number, since it is larger than the sum of its proper divisors (1).
123413301320131 is an equidigital number, since it uses as much as digits as its factorization.
123413301320131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 28.
Adding to 123413301320131 its reverse (131023103314321), we get a palindrome (254436404634452).
The spelling of 123413301320131 in words is "one hundred twenty-three trillion, four hundred thirteen billion, three hundred one million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •