Base | Representation |
---|---|
bin | 111100100100000… |
… | …100110000011111 |
3 | 2121210221200221022 |
4 | 330210010300133 |
5 | 4040104332011 |
6 | 244454154355 |
7 | 34115422304 |
oct | 7444046037 |
9 | 2553850838 |
10 | 1016089631 |
11 | 4816131a7 |
12 | 2443529bb |
13 | 13268178b |
14 | 98d390ab |
15 | 5e30d8db |
hex | 3c904c1f |
1016089631 has 4 divisors (see below), whose sum is σ = 1021409664. Its totient is φ = 1010769600.
The previous prime is 1016089603. The next prime is 1016089649. The reversal of 1016089631 is 1369806101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1369806101 = 23 ⋅59556787.
It is a cyclic number.
It is not a de Polignac number, because 1016089631 - 210 = 1016088607 is a prime.
It is a super-2 number, since 2×10160896312 = 2064876276451432322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1016089591 and 1016089600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1016089651) 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, 2659730 + ... + 2660111.
It is an arithmetic number, because the mean of its divisors is an integer number (255352416).
Almost surely, 21016089631 is an apocalyptic number.
1016089631 is a deficient number, since it is larger than the sum of its proper divisors (5320033).
1016089631 is an equidigital number, since it uses as much as digits as its factorization.
1016089631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5320032.
The product of its (nonzero) digits is 7776, while the sum is 35.
The square root of 1016089631 is about 31876.1608572927. The cubic root of 1016089631 is about 1005.3347006950.
The spelling of 1016089631 in words is "one billion, sixteen million, eighty-nine thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •