Base | Representation |
---|---|
bin | 110011011011011111011… |
… | …1100011000110100010101 |
3 | 221000201211200010001100220 |
4 | 1212312332330120310111 |
5 | 1411302113211001003 |
6 | 23011104532224553 |
7 | 1326451103435034 |
oct | 146667674306425 |
9 | 27021750101326 |
10 | 7068424703253 |
11 | 228577a520681 |
12 | 961aa916b159 |
13 | 3c371b5a9314 |
14 | 1a618394871b |
15 | c3cec890353 |
hex | 66dbef18d15 |
7068424703253 has 16 divisors (see below), whose sum is σ = 9557533841280. Its totient is φ = 4645851565824.
The previous prime is 7068424703243. The next prime is 7068424703299. The reversal of 7068424703253 is 3523074248607.
It is not a de Polignac number, because 7068424703253 - 213 = 7068424695061 is a prime.
It is a super-2 number, since 2×70684247032532 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 7068424703196 and 7068424703205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7068424703233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5984073 + ... + 7067246.
It is an arithmetic number, because the mean of its divisors is an integer number (597345865080).
Almost surely, 27068424703253 is an apocalyptic number.
7068424703253 is a gapful number since it is divisible by the number (73) formed by its first and last digit.
It is an amenable number.
7068424703253 is a deficient number, since it is larger than the sum of its proper divisors (2489109138027).
7068424703253 is a wasteful number, since it uses less digits than its factorization.
7068424703253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13053868.
The product of its (nonzero) digits is 6773760, while the sum is 51.
The spelling of 7068424703253 in words is "seven trillion, sixty-eight billion, four hundred twenty-four million, seven hundred three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •