Base | Representation |
---|---|
bin | 111110111110001… |
… | …1111100101010001 |
3 | 12110021000000210200 |
4 | 1331330133211101 |
5 | 13311412310001 |
6 | 545401045413 |
7 | 103235201004 |
oct | 17574374521 |
9 | 5407000720 |
10 | 2113010001 |
11 | 994814763 |
12 | 4ab786869 |
13 | 2789c479b |
14 | 1608b553b |
15 | c5787086 |
hex | 7df1f951 |
2113010001 has 12 divisors (see below), whose sum is σ = 3054609012. Its totient is φ = 1407527136.
The previous prime is 2113009993. The next prime is 2113010033. The reversal of 2113010001 is 1000103112.
It can be written as a sum of positive squares in 2 ways, for example, as 647651601 + 1465358400 = 25449^2 + 38280^2 .
It is not a de Polignac number, because 2113010001 - 23 = 2113009993 is a prime.
It is a super-2 number, since 2×21130100012 = 8929622528652040002, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (2113010101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 83766 + ... + 106031.
It is an arithmetic number, because the mean of its divisors is an integer number (254550751).
Almost surely, 22113010001 is an apocalyptic number.
It is an amenable number.
2113010001 is a deficient number, since it is larger than the sum of its proper divisors (941599011).
2113010001 is a wasteful number, since it uses less digits than its factorization.
2113010001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191040 (or 191037 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 2113010001 is about 45967.4885217803. The cubic root of 2113010001 is about 1283.2182204202.
Adding to 2113010001 its reverse (1000103112), we get a palindrome (3113113113).
The spelling of 2113010001 in words is "two billion, one hundred thirteen million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •