Base | Representation |
---|---|
bin | 10110110000101001011001… |
… | …100010011100001010001101 |
3 | 111010102110121210202222101012 |
4 | 112300221121202130022031 |
5 | 101110014310030013122 |
6 | 552521150524055005 |
7 | 30040662364133264 |
oct | 2660513142341215 |
9 | 433373553688335 |
10 | 100100010001037 |
11 | 299931a30531a2 |
12 | b288076994465 |
13 | 43b150ca47857 |
14 | 1aa0c1b3175db |
15 | b88c6e8327e2 |
hex | 5b0a5989c28d |
100100010001037 has 2 divisors, whose sum is σ = 100100010001038. Its totient is φ = 100100010001036.
The previous prime is 100100010001027. The next prime is 100100010001091. The reversal of 100100010001037 is 730100010001001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94942301019556 + 5157708981481 = 9743834^2 + 2271059^2 .
It is a cyclic number.
It is not a de Polignac number, because 100100010001037 - 218 = 100100009738893 is a prime.
It is a super-3 number, since 3×1001000100010373 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100100010001007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50050005000518 + 50050005000519.
It is an arithmetic number, because the mean of its divisors is an integer number (50050005000519).
Almost surely, 2100100010001037 is an apocalyptic number.
It is an amenable number.
100100010001037 is a deficient number, since it is larger than the sum of its proper divisors (1).
100100010001037 is an equidigital number, since it uses as much as digits as its factorization.
100100010001037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21, while the sum is 14.
Adding to 100100010001037 its reverse (730100010001001), we get a palindrome (830200020002038).
The spelling of 100100010001037 in words is "one hundred trillion, one hundred billion, ten million, one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •