Base | Representation |
---|---|
bin | 110000110111111111… |
… | …1110111101111111011 |
3 | 101000220201102111110022 |
4 | 1201233333313233323 |
5 | 3204423301320444 |
6 | 120114523041055 |
7 | 10403651142044 |
oct | 1415777675773 |
9 | 330821374408 |
10 | 104958229499 |
11 | 40570203332 |
12 | 1841237018b |
13 | 9b88b04956 |
14 | 511976b8cb |
15 | 2ae468e9ee |
hex | 186fff7bfb |
104958229499 has 2 divisors, whose sum is σ = 104958229500. Its totient is φ = 104958229498.
The previous prime is 104958229487. The next prime is 104958229543. The reversal of 104958229499 is 994922859401.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 104958229499 - 216 = 104958163963 is a prime.
It is a super-2 number, since 2×1049582294992 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (104958229429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52479114749 + 52479114750.
It is an arithmetic number, because the mean of its divisors is an integer number (52479114750).
Almost surely, 2104958229499 is an apocalyptic number.
104958229499 is a deficient number, since it is larger than the sum of its proper divisors (1).
104958229499 is an equidigital number, since it uses as much as digits as its factorization.
104958229499 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16796160, while the sum is 62.
The spelling of 104958229499 in words is "one hundred four billion, nine hundred fifty-eight million, two hundred twenty-nine thousand, four hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •