Base | Representation |
---|---|
bin | 11101010000111111… |
… | …000010100111010101 |
3 | 10000002221210212210022 |
4 | 131100333002213111 |
5 | 1003323402133013 |
6 | 22234042034525 |
7 | 2161463060132 |
oct | 352077024725 |
9 | 100087725708 |
10 | 31423474133 |
11 | 12365806237 |
12 | 610b7a8a45 |
13 | 2c6a27239c |
14 | 174150b589 |
15 | c3daa9008 |
hex | 750fc29d5 |
31423474133 has 2 divisors, whose sum is σ = 31423474134. Its totient is φ = 31423474132.
The previous prime is 31423474123. The next prime is 31423474171. The reversal of 31423474133 is 33147432413.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31273092964 + 150381169 = 176842^2 + 12263^2 .
It is a cyclic number.
It is not a de Polignac number, because 31423474133 - 212 = 31423470037 is a prime.
It is a super-3 number, since 3×314234741333 (a number of 32 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 31423474093 and 31423474102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31423474123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15711737066 + 15711737067.
It is an arithmetic number, because the mean of its divisors is an integer number (15711737067).
Almost surely, 231423474133 is an apocalyptic number.
It is an amenable number.
31423474133 is a deficient number, since it is larger than the sum of its proper divisors (1).
31423474133 is an equidigital number, since it uses as much as digits as its factorization.
31423474133 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 72576, while the sum is 35.
The spelling of 31423474133 in words is "thirty-one billion, four hundred twenty-three million, four hundred seventy-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •