Base | Representation |
---|---|
bin | 11110010010010101000111… |
… | …101011011110111100100011 |
3 | 122110121220010100010220111101 |
4 | 132102111013223132330203 |
5 | 114424331143433112011 |
6 | 1151143412205055231 |
7 | 40025312350121266 |
oct | 3622250753367443 |
9 | 573556110126441 |
10 | 133201023332131 |
11 | 39495267144737 |
12 | 12b33301257517 |
13 | 5942a58420411 |
14 | 24c6d6d038cdd |
15 | 105ece70012c1 |
hex | 792547adef23 |
133201023332131 has 2 divisors, whose sum is σ = 133201023332132. Its totient is φ = 133201023332130.
The previous prime is 133201023332057. The next prime is 133201023332173. The reversal of 133201023332131 is 131233320102331.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133201023332131 - 215 = 133201023299363 is a prime.
It is a super-2 number, since 2×1332010233321312 (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 133201023332131.
It is not a weakly prime, because it can be changed into another prime (133201023332731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66600511666065 + 66600511666066.
It is an arithmetic number, because the mean of its divisors is an integer number (66600511666066).
Almost surely, 2133201023332131 is an apocalyptic number.
133201023332131 is a deficient number, since it is larger than the sum of its proper divisors (1).
133201023332131 is an equidigital number, since it uses as much as digits as its factorization.
133201023332131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 133201023332131 its reverse (131233320102331), we get a palindrome (264434343434462).
The spelling of 133201023332131 in words is "one hundred thirty-three trillion, two hundred one billion, twenty-three million, three hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •