Base | Representation |
---|---|
bin | 11111010010110111011… |
… | …110000010000000111101 |
3 | 21121120222100100021110222 |
4 | 133102313132002000331 |
5 | 240213322302013401 |
6 | 4323542053511125 |
7 | 311241632162441 |
oct | 37226736020075 |
9 | 7546870307428 |
10 | 2150561751101 |
11 | 75a059052945 |
12 | 2a89629424a5 |
13 | 127a4930991a |
14 | 76132aac821 |
15 | 3ae1b071c1b |
hex | 1f4b778203d |
2150561751101 has 4 divisors (see below), whose sum is σ = 2151003259104. Its totient is φ = 2150120243100.
The previous prime is 2150561751071. The next prime is 2150561751131. The reversal of 2150561751101 is 1011571650512.
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 an interprime number because it is at equal distance from previous prime (2150561751071) and next prime (2150561751131).
It is a cyclic number.
It is not a de Polignac number, because 2150561751101 - 226 = 2150494642237 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2150561751131) 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, 220746695 + ... + 220756436.
It is an arithmetic number, because the mean of its divisors is an integer number (537750814776).
Almost surely, 22150561751101 is an apocalyptic number.
It is an amenable number.
2150561751101 is a deficient number, since it is larger than the sum of its proper divisors (441508003).
2150561751101 is an equidigital number, since it uses as much as digits as its factorization.
2150561751101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 441508002.
The product of its (nonzero) digits is 10500, while the sum is 35.
The spelling of 2150561751101 in words is "two trillion, one hundred fifty billion, five hundred sixty-one million, seven hundred fifty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •