Base | Representation |
---|---|
bin | 1110010010100001010001… |
… | …01000011000010100010101 |
3 | 11010020222101101000100020120 |
4 | 13021100220220120110111 |
5 | 13104312103034132131 |
6 | 150455212152022153 |
7 | 6422132603354022 |
oct | 711205050302425 |
9 | 133228341010216 |
10 | 31422662411541 |
11 | a015304820585 |
12 | 3635b0a091959 |
13 | 146c1b51a649b |
14 | 7a8c176c8549 |
15 | 3975977b2496 |
hex | 1c9428a18515 |
31422662411541 has 8 divisors (see below), whose sum is σ = 41936747047584. Its totient is φ = 20928509691600.
The previous prime is 31422662411533. The next prime is 31422662411557. The reversal of 31422662411541 is 14511426622413.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 31422662411541 - 23 = 31422662411533 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31422662411493 and 31422662411502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31422662411501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4982975346 + ... + 4982981651.
It is an arithmetic number, because the mean of its divisors is an integer number (5242093380948).
Almost surely, 231422662411541 is an apocalyptic number.
It is an amenable number.
31422662411541 is a deficient number, since it is larger than the sum of its proper divisors (10514084636043).
31422662411541 is a wasteful number, since it uses less digits than its factorization.
31422662411541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9965958051.
The product of its digits is 276480, while the sum is 42.
The spelling of 31422662411541 in words is "thirty-one trillion, four hundred twenty-two billion, six hundred sixty-two million, four hundred eleven thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •