Base | Representation |
---|---|
bin | 1010000100010110… |
… | …11110001001100111 |
3 | 111221200222012100120 |
4 | 11002023132021213 |
5 | 42032222130011 |
6 | 2252205413023 |
7 | 250643020335 |
oct | 50213361147 |
9 | 14850865316 |
10 | 5405270631 |
11 | 2324152912 |
12 | 106a26a173 |
13 | 681ac71b7 |
14 | 393c38b55 |
15 | 21980ba06 |
hex | 1422de267 |
5405270631 has 8 divisors (see below), whose sum is σ = 7278384624. Its totient is φ = 3567835200.
The previous prime is 5405270623. The next prime is 5405270677. The reversal of 5405270631 is 1360725045.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5405270631 - 23 = 5405270623 is a prime.
It is a super-2 number, since 2×54052706312 = 58433901188702276322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5405270592 and 5405270601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5405270131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8919286 + ... + 8919891.
It is an arithmetic number, because the mean of its divisors is an integer number (909798078).
Almost surely, 25405270631 is an apocalyptic number.
5405270631 is a deficient number, since it is larger than the sum of its proper divisors (1873113993).
5405270631 is a wasteful number, since it uses less digits than its factorization.
5405270631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17839281.
The product of its (nonzero) digits is 25200, while the sum is 33.
The square root of 5405270631 is about 73520.5456386172. The cubic root of 5405270631 is about 1754.9812506012.
Adding to 5405270631 its reverse (1360725045), we get a palindrome (6765995676).
The spelling of 5405270631 in words is "five billion, four hundred five million, two hundred seventy thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •