Base | Representation |
---|---|
bin | 11101110111001000110001… |
… | …000100011001011000011101 |
3 | 122020000020201010000011012021 |
4 | 131313020301010121120131 |
5 | 114203222104300310323 |
6 | 1143153124014340141 |
7 | 36443306435153656 |
oct | 3567106104313035 |
9 | 566006633004167 |
10 | 131332333213213 |
11 | 389348032aa030 |
12 | 128911047ba651 |
13 | 5838780248242 |
14 | 24607399c852d |
15 | 102b3c6d7a05d |
hex | 77723111961d |
131332333213213 has 16 divisors (see below), whose sum is σ = 143304813826560. Its totient is φ = 119365384446000.
The previous prime is 131332333213199. The next prime is 131332333213217. The reversal of 131332333213213 is 312312333233131.
It is not a de Polignac number, because 131332333213213 - 25 = 131332333213181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131332333213217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1652958138 + ... + 1653037588.
It is an arithmetic number, because the mean of its divisors is an integer number (8956550864160).
Almost surely, 2131332333213213 is an apocalyptic number.
It is an amenable number.
131332333213213 is a deficient number, since it is larger than the sum of its proper divisors (11972480613347).
131332333213213 is a wasteful number, since it uses less digits than its factorization.
131332333213213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112368.
The product of its digits is 52488, while the sum is 34.
Adding to 131332333213213 its reverse (312312333233131), we get a palindrome (443644666446344).
The spelling of 131332333213213 in words is "one hundred thirty-one trillion, three hundred thirty-two billion, three hundred thirty-three million, two hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •