Base | Representation |
---|---|
bin | 101110110001100000… |
… | …0011101100011001001 |
3 | 100121021012120121011010 |
4 | 1131203000131203021 |
5 | 3121203000010400 |
6 | 114051031354133 |
7 | 10154062034535 |
oct | 1354300354311 |
9 | 317235517133 |
10 | 100445313225 |
11 | 39664840564 |
12 | 17572b22949 |
13 | 9619b580aa |
14 | 4c0c25cbc5 |
15 | 292d39e450 |
hex | 176301d8c9 |
100445313225 has 48 divisors (see below), whose sum is σ = 168022728000. Its totient is φ = 52941419520.
The previous prime is 100445313197. The next prime is 100445313233. The reversal of 100445313225 is 522313544001.
It is not a de Polignac number, because 100445313225 - 216 = 100445247689 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 100445313192 and 100445313201.
It is an unprimeable number.
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 in 47 ways as a sum of consecutive naturals, for example, 23019894 + ... + 23024256.
It is an arithmetic number, because the mean of its divisors is an integer number (3500473500).
Almost surely, 2100445313225 is an apocalyptic number.
100445313225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
100445313225 is a deficient number, since it is larger than the sum of its proper divisors (67577414775).
100445313225 is a wasteful number, since it uses less digits than its factorization.
100445313225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7914 (or 7909 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 100445313225 its reverse (522313544001), we get a palindrome (622758857226).
The spelling of 100445313225 in words is "one hundred billion, four hundred forty-five million, three hundred thirteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •