Base | Representation |
---|---|
bin | 11110101101000101111… |
… | …011001111111011110001 |
3 | 21110201021200012121202001 |
4 | 132231011323033323301 |
5 | 234032241014231001 |
6 | 4253153243454001 |
7 | 305304550641553 |
oct | 36550573177361 |
9 | 7421250177661 |
10 | 2110002102001 |
11 | 7439351a7192 |
12 | 2a0b23527301 |
13 | 123c84318c61 |
14 | 741a605d4d3 |
15 | 39d4538d001 |
hex | 1eb45ecfef1 |
2110002102001 has 4 divisors (see below), whose sum is σ = 2110005076900. Its totient is φ = 2109999127104.
The previous prime is 2110002101983. The next prime is 2110002102031. The reversal of 2110002102001 is 1002012000112.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 1959302862001 + 150699240000 = 1399751^2 + 388200^2 .
It is a cyclic number.
It is not a de Polignac number, because 2110002102001 - 225 = 2109968547569 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2110002102031) 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, 263485 + ... + 2071093.
It is an arithmetic number, because the mean of its divisors is an integer number (527501269225).
Almost surely, 22110002102001 is an apocalyptic number.
It is an amenable number.
2110002102001 is a deficient number, since it is larger than the sum of its proper divisors (2974899).
2110002102001 is a wasteful number, since it uses less digits than its factorization.
2110002102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2974898.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2110002102001 its reverse (1002012000112), we get a palindrome (3112014102113).
The spelling of 2110002102001 in words is "two trillion, one hundred ten billion, two million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •