Base | Representation |
---|---|
bin | 111100100100111… |
… | …101000011100111 |
3 | 2121211101102021001 |
4 | 330210331003213 |
5 | 4040134221411 |
6 | 244503134131 |
7 | 34120402513 |
oct | 7444750347 |
9 | 2554342231 |
10 | 1016320231 |
11 | 481760483 |
12 | 244444347 |
13 | 132732724 |
14 | 98d99143 |
15 | 5e356dc1 |
hex | 3c93d0e7 |
1016320231 has 12 divisors (see below), whose sum is σ = 1081185232. Its totient is φ = 955150848.
The previous prime is 1016320223. The next prime is 1016320237. The reversal of 1016320231 is 1320236101.
It is not a de Polignac number, because 1016320231 - 23 = 1016320223 is a prime.
It is a super-2 number, since 2×10163202312 = 2065813623879786722, 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 = 1016320199 and 1016320208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1016320237) 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 11 ways as a sum of consecutive naturals, for example, 235711 + ... + 239983.
Almost surely, 21016320231 is an apocalyptic number.
1016320231 is a deficient number, since it is larger than the sum of its proper divisors (64865001).
1016320231 is an equidigital number, since it uses as much as digits as its factorization.
1016320231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5130 (or 5113 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
The square root of 1016320231 is about 31879.7777752606. Note that the first 5 decimals coincide. The cubic root of 1016320231 is about 1005.4107480040.
Adding to 1016320231 its reverse (1320236101), we get a palindrome (2336556332).
The spelling of 1016320231 in words is "one billion, sixteen million, three hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •