Base | Representation |
---|---|
bin | 101010101011011… |
… | …001101001101011 |
3 | 1211220022121020112 |
4 | 222223121221223 |
5 | 2431300122311 |
6 | 155014444535 |
7 | 23513033555 |
oct | 5253315153 |
9 | 1756277215 |
10 | 716020331 |
11 | 3381a1744 |
12 | 17b96374b |
13 | b545b290 |
14 | 6b1484d5 |
15 | 42cd928b |
hex | 2aad9a6b |
716020331 has 12 divisors (see below), whose sum is σ = 819130032. Its totient is φ = 622059648.
The previous prime is 716020321. The next prime is 716020367. The reversal of 716020331 is 133020617.
It is a happy number.
It is not a de Polignac number, because 716020331 - 26 = 716020267 is a prime.
It is a super-2 number, since 2×7160203312 = 1025370228810699122, 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 = 716020297 and 716020306.
It is not an unprimeable number, because it can be changed into a prime (716020321) 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, 91535 + ... + 99048.
It is an arithmetic number, because the mean of its divisors is an integer number (68260836).
Almost surely, 2716020331 is an apocalyptic number.
716020331 is a deficient number, since it is larger than the sum of its proper divisors (103109701).
716020331 is a wasteful number, since it uses less digits than its factorization.
716020331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190630 (or 190613 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 23.
The square root of 716020331 is about 26758.5562203943. The cubic root of 716020331 is about 894.6265541430.
Adding to 716020331 its reverse (133020617), we get a palindrome (849040948).
The spelling of 716020331 in words is "seven hundred sixteen million, twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •