Base | Representation |
---|---|
bin | 101110100101111000… |
… | …0000101110000011001 |
3 | 100120021000102000122112 |
4 | 1131023300011300121 |
5 | 3114403104123442 |
6 | 113544213002105 |
7 | 10141313463356 |
oct | 1351360056031 |
9 | 316230360575 |
10 | 100055145497 |
11 | 3948458079a |
12 | 17484323335 |
13 | 9587079c08 |
14 | 4bb24d762d |
15 | 2908ece082 |
hex | 174bc05c19 |
100055145497 has 2 divisors, whose sum is σ = 100055145498. Its totient is φ = 100055145496.
The previous prime is 100055145493. The next prime is 100055145569. The reversal of 100055145497 is 794541550001.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85870097296 + 14185048201 = 293036^2 + 119101^2 .
It is a cyclic number.
It is not a de Polignac number, because 100055145497 - 22 = 100055145493 is a prime.
It is a super-2 number, since 2×1000551454972 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100055145493) 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 as a sum of consecutive naturals, namely, 50027572748 + 50027572749.
It is an arithmetic number, because the mean of its divisors is an integer number (50027572749).
Almost surely, 2100055145497 is an apocalyptic number.
It is an amenable number.
100055145497 is a deficient number, since it is larger than the sum of its proper divisors (1).
100055145497 is an equidigital number, since it uses as much as digits as its factorization.
100055145497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126000, while the sum is 41.
Adding to 100055145497 its reverse (794541550001), we get a palindrome (894596695498).
The spelling of 100055145497 in words is "one hundred billion, fifty-five million, one hundred forty-five thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •