Base | Representation |
---|---|
bin | 11101011001010001101… |
… | …00010000000001101011 |
3 | 10120112222210010202201110 |
4 | 32230220310100001223 |
5 | 113021441014202311 |
6 | 2051553310121403 |
7 | 132653536126260 |
oct | 16545064200153 |
9 | 3515883122643 |
10 | 1010002100331 |
11 | 35a380944a14 |
12 | 1438b37b0263 |
13 | 7432053ccc3 |
14 | 36c54995267 |
15 | 1b4148db8a6 |
hex | eb28d1006b |
1010002100331 has 32 divisors (see below), whose sum is σ = 1649370590208. Its totient is φ = 537130535040.
The previous prime is 1010002100311. The next prime is 1010002100351. The reversal of 1010002100331 is 1330012000101.
It is an interprime number because it is at equal distance from previous prime (1010002100311) and next prime (1010002100351).
It is not a de Polignac number, because 1010002100331 - 217 = 1010001969259 is a prime.
It is a super-2 number, since 2×10100021003312 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1010002100311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 28240260 + ... + 28276001.
It is an arithmetic number, because the mean of its divisors is an integer number (51542830944).
Almost surely, 21010002100331 is an apocalyptic number.
1010002100331 is a deficient number, since it is larger than the sum of its proper divisors (639368489877).
1010002100331 is a wasteful number, since it uses less digits than its factorization.
1010002100331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56516331.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 1010002100331 its reverse (1330012000101), we get a palindrome (2340014100432).
The spelling of 1010002100331 in words is "one trillion, ten billion, two million, one hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.404 sec. • engine limits •