Base | Representation |
---|---|
bin | 110011011011011111100… |
… | …0010111010101010001011 |
3 | 221000201211210100000001222 |
4 | 1212312333002322222023 |
5 | 1411302114130232411 |
6 | 23011105033032255 |
7 | 1326451124123543 |
oct | 146667702725213 |
9 | 27021753300058 |
10 | 7068426414731 |
11 | 228578048a520 |
12 | 961aa985568b |
13 | 3c371ba58326 |
14 | 1a6183c72323 |
15 | c3cecacc4db |
hex | 66dbf0baa8b |
7068426414731 has 32 divisors (see below), whose sum is σ = 8273301949440. Its totient is φ = 5975160048000.
The previous prime is 7068426414727. The next prime is 7068426414767. The reversal of 7068426414731 is 1374146248607.
It is not a de Polignac number, because 7068426414731 - 22 = 7068426414727 is a prime.
It is a super-2 number, since 2×70684264147312 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (53).
It is not an unprimeable number, because it can be changed into a prime (7068426414031) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 956495 + ... + 3879656.
It is an arithmetic number, because the mean of its divisors is an integer number (258540685920).
Almost surely, 27068426414731 is an apocalyptic number.
7068426414731 is a deficient number, since it is larger than the sum of its proper divisors (1204875534709).
7068426414731 is a wasteful number, since it uses less digits than its factorization.
7068426414731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4836347.
The product of its (nonzero) digits is 5419008, while the sum is 53.
The spelling of 7068426414731 in words is "seven trillion, sixty-eight billion, four hundred twenty-six million, four hundred fourteen thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •