Base | Representation |
---|---|
bin | 1110001001111001000000… |
… | …00101111010110001001101 |
3 | 11002012122002001111012121110 |
4 | 13010330200011322301031 |
5 | 13034432342100311321 |
6 | 150111055145522233 |
7 | 6361535264111214 |
oct | 704744005726115 |
9 | 132178061435543 |
10 | 31126166416461 |
11 | 9a10595537016 |
12 | 35a85621a3379 |
13 | 144a2532b708c |
14 | 79872baa807b |
15 | 38e9e2a52176 |
hex | 1c4f2017ac4d |
31126166416461 has 16 divisors (see below), whose sum is σ = 42223172479488. Its totient is φ = 20391872986800.
The previous prime is 31126166416459. The next prime is 31126166416489. The reversal of 31126166416461 is 16461466162113.
It is a happy number.
It is not a de Polignac number, because 31126166416461 - 21 = 31126166416459 is a prime.
It is a super-2 number, since 2×311261664164612 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 31126166416461.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31126166416661) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 237934995 + ... + 238065776.
It is an arithmetic number, because the mean of its divisors is an integer number (2638948279968).
Almost surely, 231126166416461 is an apocalyptic number.
It is an amenable number.
31126166416461 is a deficient number, since it is larger than the sum of its proper divisors (11097006063027).
31126166416461 is a wasteful number, since it uses less digits than its factorization.
31126166416461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476001152.
The product of its digits is 746496, while the sum is 48.
The spelling of 31126166416461 in words is "thirty-one trillion, one hundred twenty-six billion, one hundred sixty-six million, four hundred sixteen thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •