Base | Representation |
---|---|
bin | 10100010110111001… |
… | …01001110101000011 |
3 | 1001012200202001120202 |
4 | 22023130221311003 |
5 | 134340421311404 |
6 | 5004304355415 |
7 | 534562016126 |
oct | 121334516503 |
9 | 31180661522 |
10 | 10929478979 |
11 | 46a9451361 |
12 | 2150315b6b |
13 | 1052435933 |
14 | 7597943bd |
15 | 43e7ae21e |
hex | 28b729d43 |
10929478979 has 2 divisors, whose sum is σ = 10929478980. Its totient is φ = 10929478978.
The previous prime is 10929478969. The next prime is 10929478981. The reversal of 10929478979 is 97987492901.
10929478979 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (97987492901) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10929478979 is a prime.
It is a super-3 number, since 3×109294789793 (a number of 31 digits) contains 333 as substring.
Together with 10929478981, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10929478949) 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 as a sum of consecutive naturals, namely, 5464739489 + 5464739490.
It is an arithmetic number, because the mean of its divisors is an integer number (5464739490).
Almost surely, 210929478979 is an apocalyptic number.
10929478979 is a deficient number, since it is larger than the sum of its proper divisors (1).
10929478979 is an equidigital number, since it uses as much as digits as its factorization.
10929478979 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20575296, while the sum is 65.
The spelling of 10929478979 in words is "ten billion, nine hundred twenty-nine million, four hundred seventy-eight thousand, nine hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •