Base | Representation |
---|---|
bin | 10011100000110111… |
… | …11111001100001011 |
3 | 1000001010001011122022 |
4 | 21300123333030023 |
5 | 132423414210444 |
6 | 4451315515055 |
7 | 520420150352 |
oct | 116033771413 |
9 | 30033034568 |
10 | 10476319499 |
11 | 4496677998 |
12 | 20445b8a8b |
13 | cac5a0b29 |
14 | 715512999 |
15 | 414ae99ee |
hex | 2706ff30b |
10476319499 has 2 divisors, whose sum is σ = 10476319500. Its totient is φ = 10476319498.
The previous prime is 10476319489. The next prime is 10476319501. The reversal of 10476319499 is 99491367401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10476319499 - 212 = 10476315403 is a prime.
It is a super-2 number, since 2×104763194992 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 10476319501, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10476319499.
It is not a weakly prime, because it can be changed into another prime (10476319429) 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 as a sum of consecutive naturals, namely, 5238159749 + 5238159750.
It is an arithmetic number, because the mean of its divisors is an integer number (5238159750).
Almost surely, 210476319499 is an apocalyptic number.
10476319499 is a deficient number, since it is larger than the sum of its proper divisors (1).
10476319499 is an equidigital number, since it uses as much as digits as its factorization.
10476319499 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1469664, while the sum is 53.
The spelling of 10476319499 in words is "ten billion, four hundred seventy-six million, three hundred nineteen thousand, four hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •