Base | Representation |
---|---|
bin | 1000000000011011001… |
… | …00001100110000101001 |
3 | 222022002120112102000001 |
4 | 10000031210030300221 |
5 | 14001404002001301 |
6 | 330214241343001 |
7 | 25606241111620 |
oct | 4001544146051 |
9 | 868076472001 |
10 | 275105500201 |
11 | a6742979124 |
12 | 45398337a61 |
13 | 1cc3341355c |
14 | d45abbc6b7 |
15 | 7251dcac01 |
hex | 400d90cc29 |
275105500201 has 8 divisors (see below), whose sum is σ = 314441412480. Its totient is φ = 235778369568.
The previous prime is 275105500199. The next prime is 275105500223. The reversal of 275105500201 is 102005501572.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 275105500201 - 21 = 275105500199 is a prime.
It is a super-2 number, since 2×2751055002012 (a number of 24 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 275105500201.
It is not an unprimeable number, because it can be changed into a prime (275105501201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2128141 + ... + 2253706.
It is an arithmetic number, because the mean of its divisors is an integer number (39305176560).
Almost surely, 2275105500201 is an apocalyptic number.
It is an amenable number.
275105500201 is a deficient number, since it is larger than the sum of its proper divisors (39335912279).
275105500201 is an equidigital number, since it uses as much as digits as its factorization.
275105500201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4390823.
The product of its (nonzero) digits is 3500, while the sum is 28.
The spelling of 275105500201 in words is "two hundred seventy-five billion, one hundred five million, five hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •