Base | Representation |
---|---|
bin | 110011011011100110111… |
… | …0111100100110111000111 |
3 | 221000202111010021112021022 |
4 | 1212313031313210313013 |
5 | 1411303121311200403 |
6 | 23011145435141355 |
7 | 1326460233662021 |
oct | 146671567446707 |
9 | 27022433245238 |
10 | 7068675100103 |
11 | 22858988a5521 |
12 | 961b58ba485b |
13 | 3c375b42a536 |
14 | 1a61a8cc9011 |
15 | c3d14851d38 |
hex | 66dcdde4dc7 |
7068675100103 has 8 divisors (see below), whose sum is σ = 7112633071488. Its totient is φ = 7024736540664.
The previous prime is 7068675100087. The next prime is 7068675100111. The reversal of 7068675100103 is 3010015768607.
7068675100103 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 7068675100103 - 24 = 7068675100087 is a prime.
It is a super-2 number, since 2×70686751001032 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7068675100183) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4122101 + ... + 5579342.
It is an arithmetic number, because the mean of its divisors is an integer number (889079133936).
Almost surely, 27068675100103 is an apocalyptic number.
7068675100103 is a deficient number, since it is larger than the sum of its proper divisors (43957971385).
7068675100103 is a wasteful number, since it uses less digits than its factorization.
7068675100103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9705973.
The product of its (nonzero) digits is 211680, while the sum is 44.
The spelling of 7068675100103 in words is "seven trillion, sixty-eight billion, six hundred seventy-five million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •