Base | Representation |
---|---|
bin | 101110110100101010… |
… | …0110111100101100101 |
3 | 100121112121001121102011 |
4 | 1131221110313211211 |
5 | 3121412114413203 |
6 | 114105335514221 |
7 | 10156520112043 |
oct | 1355124674545 |
9 | 317477047364 |
10 | 100551326053 |
11 | 39709669572 |
12 | 175a2528971 |
13 | 9635ac5689 |
14 | 4c1c377393 |
15 | 293784076d |
hex | 1769537965 |
100551326053 has 6 divisors (see below), whose sum is σ = 103899550182. Its totient is φ = 97307733960.
The previous prime is 100551326041. The next prime is 100551326077. The reversal of 100551326053 is 350623155001.
It can be written as a sum of positive squares in only one way, i.e., 88528861444 + 12022464609 = 297538^2 + 109647^2 .
It is not a de Polignac number, because 100551326053 - 225 = 100517771621 is a prime.
It is a super-2 number, since 2×1005513260532 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100551326023) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 52315026 + ... + 52316947.
It is an arithmetic number, because the mean of its divisors is an integer number (17316591697).
Almost surely, 2100551326053 is an apocalyptic number.
It is an amenable number.
100551326053 is a deficient number, since it is larger than the sum of its proper divisors (3348224129).
100551326053 is an equidigital number, since it uses as much as digits as its factorization.
100551326053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104632035 (or 104632004 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 31.
The spelling of 100551326053 in words is "one hundred billion, five hundred fifty-one million, three hundred twenty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •