Base | Representation |
---|---|
bin | 111101001001011010… |
… | …0011010011110001101 |
3 | 110112221101010112222100 |
4 | 1322102310122132031 |
5 | 4122411412413313 |
6 | 140153552505313 |
7 | 12326016362412 |
oct | 1722264323615 |
9 | 415841115870 |
10 | 131312232333 |
11 | 50764371767 |
12 | 2154824b239 |
13 | c4c8a03479 |
14 | 64d9892109 |
15 | 363816d173 |
hex | 1e92d1a78d |
131312232333 has 6 divisors (see below), whose sum is σ = 189673224494. Its totient is φ = 87541488216.
The previous prime is 131312232329. The next prime is 131312232347. The reversal of 131312232333 is 333232213131.
131312232333 is a `hidden beast` number, since 1 + 313 + 1 + 22 + 323 + 3 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 80090132004 + 51222100329 = 283002^2 + 226323^2 .
It is not a de Polignac number, because 131312232333 - 22 = 131312232329 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131312232297 and 131312232306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131312232313) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7295124010 + ... + 7295124027.
Almost surely, 2131312232333 is an apocalyptic number.
It is an amenable number.
131312232333 is a deficient number, since it is larger than the sum of its proper divisors (58360992161).
131312232333 is a wasteful number, since it uses less digits than its factorization.
131312232333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14590248043 (or 14590248040 counting only the distinct ones).
The product of its digits is 5832, while the sum is 27.
Adding to 131312232333 its reverse (333232213131), we get a palindrome (464544445464).
The spelling of 131312232333 in words is "one hundred thirty-one billion, three hundred twelve million, two hundred thirty-two thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •