Base | Representation |
---|---|
bin | 11101001101101001… |
… | …111100110101001000 |
3 | 2222222001200212202220 |
4 | 131031221330311020 |
5 | 1003220102120033 |
6 | 22224324454040 |
7 | 2160214214001 |
oct | 351551746510 |
9 | 88861625686 |
10 | 31367613768 |
11 | 12337222547 |
12 | 60b4b4a320 |
13 | 2c5b81470a |
14 | 1737d2a1a8 |
15 | c38c22bb3 |
hex | 74da7cd48 |
31367613768 has 16 divisors (see below), whose sum is σ = 78419034480. Its totient is φ = 10455871248.
The previous prime is 31367613743. The next prime is 31367613793. The reversal of 31367613768 is 86731676313.
It is an interprime number because it is at equal distance from previous prime (31367613743) and next prime (31367613793).
It is a hoax number, since the sum of its digits (51) coincides with the sum of the digits of its distinct prime factors.
It is a self number, because there is not a number n which added to its sum of digits gives 31367613768.
It is an unprimeable number.
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 in 3 ways as a sum of consecutive naturals, for example, 653491930 + ... + 653491977.
It is an arithmetic number, because the mean of its divisors is an integer number (4901189655).
Almost surely, 231367613768 is an apocalyptic number.
It is an amenable number.
31367613768 is an abundant number, since it is smaller than the sum of its proper divisors (47051420712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31367613768 is a wasteful number, since it uses less digits than its factorization.
31367613768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1306983916 (or 1306983912 counting only the distinct ones).
The product of its digits is 2286144, while the sum is 51.
The spelling of 31367613768 in words is "thirty-one billion, three hundred sixty-seven million, six hundred thirteen thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •