Base | Representation |
---|---|
bin | 11011000011101010001… |
… | …00100011101100001011 |
3 | 10021212122210102012000211 |
4 | 31201311010203230023 |
5 | 110212434312034341 |
6 | 1551030541541551 |
7 | 124111156444564 |
oct | 15416504435413 |
9 | 3255583365024 |
10 | 929677064971 |
11 | 329301514a76 |
12 | 130216b748b7 |
13 | 6988bc83095 |
14 | 32dd49ab16b |
15 | 192b2b16181 |
hex | d875123b0b |
929677064971 has 4 divisors (see below), whose sum is σ = 959666647744. Its totient is φ = 899687482200.
The previous prime is 929677064947. The next prime is 929677065029. The reversal of 929677064971 is 179460776929.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 179460776929 = 7 ⋅25637253847.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-929677064971 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 929677064897 and 929677064906.
It is not an unprimeable number, because it can be changed into a prime (929677064671) by changing a digit.
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, 14994791340 + ... + 14994791401.
It is an arithmetic number, because the mean of its divisors is an integer number (239916661936).
Almost surely, 2929677064971 is an apocalyptic number.
929677064971 is a deficient number, since it is larger than the sum of its proper divisors (29989582773).
929677064971 is a wasteful number, since it uses less digits than its factorization.
929677064971 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29989582772.
The product of its (nonzero) digits is 72013536, while the sum is 67.
The spelling of 929677064971 in words is "nine hundred twenty-nine billion, six hundred seventy-seven million, sixty-four thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •