Base | Representation |
---|---|
bin | 101110110000010010… |
… | …0100010111111001101 |
3 | 100121011100200002001101 |
4 | 1131200210202333031 |
5 | 3121112014103122 |
6 | 114043011343101 |
7 | 10153054444615 |
oct | 1354044427715 |
9 | 317140602041 |
10 | 100404441037 |
11 | 3964376469a |
12 | 175612b1a91 |
13 | 9611547574 |
14 | 4c06a5da45 |
15 | 29299c9027 |
hex | 1760922fcd |
100404441037 has 2 divisors, whose sum is σ = 100404441038. Its totient is φ = 100404441036.
The previous prime is 100404441031. The next prime is 100404441061. The reversal of 100404441037 is 730144404001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 81308241316 + 19096199721 = 285146^2 + 138189^2 .
It is a cyclic number.
It is not a de Polignac number, because 100404441037 - 23 = 100404441029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100404440996 and 100404441014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100404441031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50202220518 + 50202220519.
It is an arithmetic number, because the mean of its divisors is an integer number (50202220519).
Almost surely, 2100404441037 is an apocalyptic number.
It is an amenable number.
100404441037 is a deficient number, since it is larger than the sum of its proper divisors (1).
100404441037 is an equidigital number, since it uses as much as digits as its factorization.
100404441037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5376, while the sum is 28.
Adding to 100404441037 its reverse (730144404001), we get a palindrome (830548845038).
The spelling of 100404441037 in words is "one hundred billion, four hundred four million, four hundred forty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •