Base | Representation |
---|---|
bin | 10111111000101011011100… |
… | …010000111100100100101101 |
3 | 111202221200102111201002001001 |
4 | 113320223130100330210231 |
5 | 102232114402410234001 |
6 | 1011231150055520301 |
7 | 31061420032126066 |
oct | 2770533420744455 |
9 | 452850374632031 |
10 | 105050005555501 |
11 | 30521503540706 |
12 | b94748a389091 |
13 | 46802331737b6 |
14 | 1bd263993356d |
15 | c228d20d2001 |
hex | 5f8adc43c92d |
105050005555501 has 4 divisors (see below), whose sum is σ = 105050077690752. Its totient is φ = 105049933420252.
The previous prime is 105050005555477. The next prime is 105050005555609. The reversal of 105050005555501 is 105555500050501.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 105050005555501 - 215 = 105050005522733 is a prime.
It is a super-2 number, since 2×1050500055555012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105050005553501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33837211 + ... + 36811096.
It is an arithmetic number, because the mean of its divisors is an integer number (26262519422688).
Almost surely, 2105050005555501 is an apocalyptic number.
It is an amenable number.
105050005555501 is a deficient number, since it is larger than the sum of its proper divisors (72135251).
105050005555501 is an equidigital number, since it uses as much as digits as its factorization.
105050005555501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72135250.
The product of its (nonzero) digits is 78125, while the sum is 37.
The spelling of 105050005555501 in words is "one hundred five trillion, fifty billion, five million, five hundred fifty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •