Base | Representation |
---|---|
bin | 11101100101100110… |
… | …100001111101111100 |
3 | 10001000001200020101120 |
4 | 131211212201331330 |
5 | 1010030424323432 |
6 | 22332235510540 |
7 | 2203163123256 |
oct | 354546417574 |
9 | 101001606346 |
10 | 31769370492 |
11 | 12522a882a2 |
12 | 61a75b8450 |
13 | 2cc3b1c7a2 |
14 | 177542acd6 |
15 | c5e131c2c |
hex | 7659a1f7c |
31769370492 has 12 divisors (see below), whose sum is σ = 74128531176. Its totient is φ = 10589790160.
The previous prime is 31769370487. The next prime is 31769370497. The reversal of 31769370492 is 29407396713.
It is an interprime number because it is at equal distance from previous prime (31769370487) and next prime (31769370497).
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31769370497) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1323723759 + ... + 1323723782.
It is an arithmetic number, because the mean of its divisors is an integer number (6177377598).
Almost surely, 231769370492 is an apocalyptic number.
It is an amenable number.
31769370492 is an abundant number, since it is smaller than the sum of its proper divisors (42359160684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31769370492 is a wasteful number, since it uses less digits than its factorization.
31769370492 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2647447548 (or 2647447546 counting only the distinct ones).
The product of its (nonzero) digits is 1714608, while the sum is 51.
The spelling of 31769370492 in words is "thirty-one billion, seven hundred sixty-nine million, three hundred seventy thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •