Base | Representation |
---|---|
bin | 11010110011010000011… |
… | …11101000100000010001 |
3 | 10021000221010222222102002 |
4 | 31121220033220200101 |
5 | 110041421203223443 |
6 | 1543013121203345 |
7 | 123350031153020 |
oct | 15315017504021 |
9 | 3230833888362 |
10 | 920871929873 |
11 | 3255a3219715 |
12 | 12a57a190555 |
13 | 68ab79ac97c |
14 | 327db3dc8b7 |
15 | 18e49acc2b8 |
hex | d6683e8811 |
920871929873 has 8 divisors (see below), whose sum is σ = 1053013352640. Its totient is φ = 788877579600.
The previous prime is 920871929843. The next prime is 920871929917. The reversal of 920871929873 is 378929178029.
It is a happy number.
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 920871929873 - 212 = 920871925777 is a prime.
It is a super-2 number, since 2×9208719298732 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (920871929843) 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, 36754703 + ... + 36779748.
It is an arithmetic number, because the mean of its divisors is an integer number (131626669080).
Almost surely, 2920871929873 is an apocalyptic number.
It is an amenable number.
920871929873 is a deficient number, since it is larger than the sum of its proper divisors (132141422767).
920871929873 is a wasteful number, since it uses less digits than its factorization.
920871929873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73536247.
The product of its (nonzero) digits is 27433728, while the sum is 65.
The spelling of 920871929873 in words is "nine hundred twenty billion, eight hundred seventy-one million, nine hundred twenty-nine thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •