Base | Representation |
---|---|
bin | 111110100111101… |
… | …0000000111001001 |
3 | 12102102200111011001 |
4 | 1331033100013021 |
5 | 13300343301103 |
6 | 544254535001 |
7 | 103032324124 |
oct | 17517200711 |
9 | 5372614131 |
10 | 2101150153 |
11 | 989054233 |
12 | 4a7807461 |
13 | 27640151b |
14 | 15d0a93bb |
15 | c46e301d |
hex | 7d3d01c9 |
2101150153 has 4 divisors (see below), whose sum is σ = 2102794240. Its totient is φ = 2099506068.
The previous prime is 2101150111. The next prime is 2101150157. The reversal of 2101150153 is 3510511012.
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 2101150153 - 29 = 2101149641 is a prime.
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 2101150153.
It is not an unprimeable number, because it can be changed into a prime (2101150157) 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, 820125 + ... + 822682.
It is an arithmetic number, because the mean of its divisors is an integer number (525698560).
Almost surely, 22101150153 is an apocalyptic number.
It is an amenable number.
2101150153 is a deficient number, since it is larger than the sum of its proper divisors (1644087).
2101150153 is a wasteful number, since it uses less digits than its factorization.
2101150153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1644086.
The product of its (nonzero) digits is 150, while the sum is 19.
The square root of 2101150153 is about 45838.3044298107. The cubic root of 2101150153 is about 1280.8129099333.
Adding to 2101150153 its reverse (3510511012), we get a palindrome (5611661165).
The spelling of 2101150153 in words is "two billion, one hundred one million, one hundred fifty thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •