Base | Representation |
---|---|
bin | 101110110001101001… |
… | …0100000011010100101 |
3 | 100121021112110220221121 |
4 | 1131203102200122211 |
5 | 3121210202343212 |
6 | 114051321013541 |
7 | 10154150165563 |
oct | 1354322403245 |
9 | 317245426847 |
10 | 100450043557 |
11 | 39667481526 |
12 | 175746242b1 |
13 | 961ab231c6 |
14 | 4c0cb30a33 |
15 | 292d9d5d07 |
hex | 17634a06a5 |
100450043557 has 2 divisors, whose sum is σ = 100450043558. Its totient is φ = 100450043556.
The previous prime is 100450043497. The next prime is 100450043569. The reversal of 100450043557 is 755340054001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 81933910081 + 18516133476 = 286241^2 + 136074^2 .
It is a cyclic number.
It is not a de Polignac number, because 100450043557 - 211 = 100450041509 is a prime.
It is a super-2 number, since 2×1004500435572 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100450043357) 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, 50225021778 + 50225021779.
It is an arithmetic number, because the mean of its divisors is an integer number (50225021779).
Almost surely, 2100450043557 is an apocalyptic number.
It is an amenable number.
100450043557 is a deficient number, since it is larger than the sum of its proper divisors (1).
100450043557 is an equidigital number, since it uses as much as digits as its factorization.
100450043557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42000, while the sum is 34.
Adding to 100450043557 its reverse (755340054001), we get a palindrome (855790097558).
The spelling of 100450043557 in words is "one hundred billion, four hundred fifty million, forty-three thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •