Base | Representation |
---|---|
bin | 10011111010011110… |
… | …10110000010110110 |
3 | 1000121002012121111201 |
4 | 21331033112002312 |
5 | 133343410442141 |
6 | 4524511323114 |
7 | 525635633062 |
oct | 117517260266 |
9 | 30532177451 |
10 | 10691109046 |
11 | 4596941512 |
12 | 20a452049a |
13 | 1014c35a37 |
14 | 735c64aa2 |
15 | 4288c6031 |
hex | 27d3d60b6 |
10691109046 has 8 divisors (see below), whose sum is σ = 16037180640. Its totient is φ = 5345382168.
The previous prime is 10691109017. The next prime is 10691109053. The reversal of 10691109046 is 64090119601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×106911090462 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10691108996 and 10691109014.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15220 + ... + 147016.
It is an arithmetic number, because the mean of its divisors is an integer number (2004647580).
Almost surely, 210691109046 is an apocalyptic number.
10691109046 is a deficient number, since it is larger than the sum of its proper divisors (5346071594).
10691109046 is a wasteful number, since it uses less digits than its factorization.
10691109046 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172358.
The product of its (nonzero) digits is 11664, while the sum is 37.
The spelling of 10691109046 in words is "ten billion, six hundred ninety-one million, one hundred nine thousand, forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •