Base | Representation |
---|---|
bin | 11110100011110010010… |
… | …11011010100001110001 |
3 | 10201101020122202110002101 |
4 | 33101321023122201301 |
5 | 114200402243234401 |
6 | 2122210552220401 |
7 | 135601050466105 |
oct | 17217113324161 |
9 | 3641218673071 |
10 | 1050005055601 |
11 | 375339531327 |
12 | 14b5b869a701 |
13 | 780270b8738 |
14 | 38b6b6d1905 |
15 | 1c4a67a9101 |
hex | f4792da871 |
1050005055601 has 4 divisors (see below), whose sum is σ = 1105268479600. Its totient is φ = 994741631604.
The previous prime is 1050005055581. The next prime is 1050005055647. The reversal of 1050005055601 is 1065505000501.
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 not a de Polignac number, because 1050005055601 - 233 = 1041415121009 is a prime.
It is a super-2 number, since 2×10500050556012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1050005055601.
It is not an unprimeable number, because it can be changed into a prime (1050005055661) 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, 27631711971 + ... + 27631712008.
It is an arithmetic number, because the mean of its divisors is an integer number (276317119900).
Almost surely, 21050005055601 is an apocalyptic number.
It is an amenable number.
1050005055601 is a deficient number, since it is larger than the sum of its proper divisors (55263423999).
1050005055601 is an equidigital number, since it uses as much as digits as its factorization.
1050005055601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55263423998.
The product of its (nonzero) digits is 3750, while the sum is 28.
The spelling of 1050005055601 in words is "one trillion, fifty billion, five million, fifty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •