Base | Representation |
---|---|
bin | 1100000010010001111101… |
… | …1101101111101011010011 |
3 | 1201212002111222020210221201 |
4 | 3000210133131233223103 |
5 | 3213303320431131011 |
6 | 44051145415332031 |
7 | 2534035026110005 |
oct | 300443735575323 |
9 | 51762458223851 |
10 | 13233322130131 |
11 | 4242247394514 |
12 | 1598858981017 |
13 | 74cb876cc84c |
14 | 33a6d384c375 |
15 | 17e368209cc1 |
hex | c091f76fad3 |
13233322130131 has 2 divisors, whose sum is σ = 13233322130132. Its totient is φ = 13233322130130.
The previous prime is 13233322130107. The next prime is 13233322130143. The reversal of 13233322130131 is 13103122333231.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13233322130131 - 25 = 13233322130099 is a prime.
It is a super-2 number, since 2×132333221301312 (a number of 27 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 13233322130131.
It is not a weakly prime, because it can be changed into another prime (13233322130101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6616661065065 + 6616661065066.
It is an arithmetic number, because the mean of its divisors is an integer number (6616661065066).
Almost surely, 213233322130131 is an apocalyptic number.
13233322130131 is a deficient number, since it is larger than the sum of its proper divisors (1).
13233322130131 is an equidigital number, since it uses as much as digits as its factorization.
13233322130131 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 13233322130131 its reverse (13103122333231), we get a palindrome (26336444463362).
The spelling of 13233322130131 in words is "thirteen trillion, two hundred thirty-three billion, three hundred twenty-two million, one hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •