Base | Representation |
---|---|
bin | 10011111000001010… |
… | …10011101110001001 |
3 | 1000112201200120111111 |
4 | 21330011103232021 |
5 | 133323423411443 |
6 | 4522535330321 |
7 | 525311650351 |
oct | 117405235611 |
9 | 30481616444 |
10 | 10671700873 |
11 | 45869958a9 |
12 | 2099b209a1 |
13 | 1010bcbb02 |
14 | 733451b61 |
15 | 426d4069d |
hex | 27c153b89 |
10671700873 has 8 divisors (see below), whose sum is σ = 11236780800. Its totient is φ = 10106962128.
The previous prime is 10671700843. The next prime is 10671700909. The reversal of 10671700873 is 37800717601.
10671700873 is digitally balanced in base 2, 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 a de Polignac number, because none of the positive numbers 2k-10671700873 is a prime.
It is a super-2 number, since 2×106717008732 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10671700843) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19786 + ... + 147427.
It is an arithmetic number, because the mean of its divisors is an integer number (1404597600).
Almost surely, 210671700873 is an apocalyptic number.
It is an amenable number.
10671700873 is a deficient number, since it is larger than the sum of its proper divisors (565079927).
10671700873 is a wasteful number, since it uses less digits than its factorization.
10671700873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170591.
The product of its (nonzero) digits is 49392, while the sum is 40.
The spelling of 10671700873 in words is "ten billion, six hundred seventy-one million, seven hundred thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •