Base | Representation |
---|---|
bin | 11101011001011110011… |
… | …11110110110111011001 |
3 | 10120120021022011200001202 |
4 | 32230233033312313121 |
5 | 113022201130004401 |
6 | 2052012122523545 |
7 | 132656316224312 |
oct | 16545717666731 |
9 | 3516238150052 |
10 | 1010110000601 |
11 | 35a426841a99 |
12 | 1439239665b5 |
13 | 743399bb710 |
14 | 36c65041609 |
15 | 1b41e10206b |
hex | eb2f3f6dd9 |
1010110000601 has 12 divisors (see below), whose sum is σ = 1095160824492. Its totient is φ = 926151186624.
The previous prime is 1010110000597. The next prime is 1010110000609. The reversal of 1010110000601 is 1060000110101.
It can be written as a sum of positive squares in 6 ways, for example, as 466570963600 + 543539037001 = 683060^2 + 737251^2 .
It is not a de Polignac number, because 1010110000601 - 22 = 1010110000597 is a prime.
It is a super-2 number, since 2×10101100006012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010110000609) 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, 1461326 + ... + 2038551.
It is an arithmetic number, because the mean of its divisors is an integer number (91263402041).
Almost surely, 21010110000601 is an apocalyptic number.
It is an amenable number.
1010110000601 is a deficient number, since it is larger than the sum of its proper divisors (85050823891).
1010110000601 is an equidigital number, since it uses as much as digits as its factorization.
1010110000601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3500188 (or 3500039 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 1010110000601 its reverse (1060000110101), we get a palindrome (2070110110702).
The spelling of 1010110000601 in words is "one trillion, ten billion, one hundred ten million, six hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •