Base | Representation |
---|---|
bin | 11110001111101100101001… |
… | …011000000100111110110011 |
3 | 122102222121012022110122102101 |
4 | 132033230221120010332303 |
5 | 114413400204313132011 |
6 | 1150524334042001231 |
7 | 40006246506542335 |
oct | 3617545130047663 |
9 | 572877168418371 |
10 | 133020126302131 |
11 | 39425578519652 |
12 | 12b042371a6217 |
13 | 592b9899b22b3 |
14 | 24bc2cc057455 |
15 | 105a25aba62c1 |
hex | 78fb29604fb3 |
133020126302131 has 2 divisors, whose sum is σ = 133020126302132. Its totient is φ = 133020126302130.
The previous prime is 133020126302123. The next prime is 133020126302221. The reversal of 133020126302131 is 131203621020331.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 133020126302131 - 23 = 133020126302123 is a prime.
It is a super-2 number, since 2×1330201263021312 (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 133020126302131.
It is not a weakly prime, because it can be changed into another prime (133020126302111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66510063151065 + 66510063151066.
It is an arithmetic number, because the mean of its divisors is an integer number (66510063151066).
Almost surely, 2133020126302131 is an apocalyptic number.
133020126302131 is a deficient number, since it is larger than the sum of its proper divisors (1).
133020126302131 is an equidigital number, since it uses as much as digits as its factorization.
133020126302131 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 133020126302131 its reverse (131203621020331), we get a palindrome (264223747322462).
The spelling of 133020126302131 in words is "one hundred thirty-three trillion, twenty billion, one hundred twenty-six million, three hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •