Base | Representation |
---|---|
bin | 11100000010001000011… |
… | …010100001010011000101 |
3 | 20211011110111102221121211 |
4 | 130002020122201103011 |
5 | 223030314101031432 |
6 | 4032554102211421 |
7 | 256115554561102 |
oct | 34021032412305 |
9 | 6734414387554 |
10 | 1926434002117 |
11 | 682aa5854829 |
12 | 271432a23b71 |
13 | 10c87b3b3401 |
14 | 69350419aa9 |
15 | 3519e7c4d47 |
hex | 1c0886a14c5 |
1926434002117 has 8 divisors (see below), whose sum is σ = 1997708525696. Its totient is φ = 1856170464912.
The previous prime is 1926434002109. The next prime is 1926434002123. The reversal of 1926434002117 is 7112004346291.
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 1926434002117 - 23 = 1926434002109 is a prime.
It is a super-2 number, since 2×19264340021172 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1926434002117.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1926434002127) 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, 252742713 + ... + 252750334.
It is an arithmetic number, because the mean of its divisors is an integer number (249713565712).
Almost surely, 21926434002117 is an apocalyptic number.
It is an amenable number.
1926434002117 is a deficient number, since it is larger than the sum of its proper divisors (71274523579).
1926434002117 is a wasteful number, since it uses less digits than its factorization.
1926434002117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505493187.
The product of its (nonzero) digits is 72576, while the sum is 40.
The spelling of 1926434002117 in words is "one trillion, nine hundred twenty-six billion, four hundred thirty-four million, two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •