Base | Representation |
---|---|
bin | 111111001011101… |
… | …0010011100110101 |
3 | 12110202012220001112 |
4 | 1332113102130311 |
5 | 13320212042401 |
6 | 550211404405 |
7 | 103351664303 |
oct | 17627223465 |
9 | 5422186045 |
10 | 2120034101 |
11 | 998781aa9 |
12 | 4b1bb3705 |
13 | 27a2b3963 |
14 | 1617c3273 |
15 | c61c33bb |
hex | 7e5d2735 |
2120034101 has 4 divisors (see below), whose sum is σ = 2128480704. Its totient is φ = 2111587500.
The previous prime is 2120034097. The next prime is 2120034127. The reversal of 2120034101 is 1014300212.
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 2120034101 - 22 = 2120034097 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 (2120034001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4222925 + ... + 4223426.
It is an arithmetic number, because the mean of its divisors is an integer number (532120176).
Almost surely, 22120034101 is an apocalyptic number.
It is an amenable number.
2120034101 is a deficient number, since it is larger than the sum of its proper divisors (8446603).
2120034101 is an equidigital number, since it uses as much as digits as its factorization.
2120034101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8446602.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 2120034101 is about 46043.8280445925. The cubic root of 2120034101 is about 1284.6385456039.
Adding to 2120034101 its reverse (1014300212), we get a palindrome (3134334313).
The spelling of 2120034101 in words is "two billion, one hundred twenty million, thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •