Base | Representation |
---|---|
bin | 11100111110010111011… |
… | …00111100001011000101 |
3 | 10112011200221101002012112 |
4 | 32133023230330023011 |
5 | 112302344040013104 |
6 | 2041203542430405 |
7 | 131632531612241 |
oct | 16371354741305 |
9 | 3464627332175 |
10 | 995555001029 |
11 | 354237931426 |
12 | 140b41432405 |
13 | 72b5a40b834 |
14 | 36283d77421 |
15 | 1ad6b3de86e |
hex | e7cbb3c2c5 |
995555001029 has 2 divisors, whose sum is σ = 995555001030. Its totient is φ = 995555001028.
The previous prime is 995555000893. The next prime is 995555001031. The reversal of 995555001029 is 920100555599.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 977128296004 + 18426705025 = 988498^2 + 135745^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-995555001029 is a prime.
It is a super-2 number, since 2×9955550010292 (a number of 25 digits) contains 22 as substring.
Together with 995555001031, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (995555021029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 497777500514 + 497777500515.
It is an arithmetic number, because the mean of its divisors is an integer number (497777500515).
Almost surely, 2995555001029 is an apocalyptic number.
It is an amenable number.
995555001029 is a deficient number, since it is larger than the sum of its proper divisors (1).
995555001029 is an equidigital number, since it uses as much as digits as its factorization.
995555001029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 911250, while the sum is 50.
The spelling of 995555001029 in words is "nine hundred ninety-five billion, five hundred fifty-five million, one thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •