Base | Representation |
---|---|
bin | 1011111101010… |
… | …10101110101001 |
3 | 20222202110222021 |
4 | 11332222232221 |
5 | 201140022100 |
6 | 13542024441 |
7 | 2325440500 |
oct | 576525651 |
9 | 228673867 |
10 | 100314025 |
11 | 51696459 |
12 | 29718121 |
13 | 17a23716 |
14 | d473837 |
15 | 8c17a1a |
hex | 5faaba9 |
100314025 has 36 divisors (see below), whose sum is σ = 153241308. Its totient is φ = 64727040.
The previous prime is 100314023. The next prime is 100314031. The reversal of 100314025 is 520413001.
It can be written as a sum of positive squares in 6 ways, for example, as 5368489 + 94945536 = 2317^2 + 9744^2 .
It is not a de Polignac number, because 100314025 - 21 = 100314023 is a prime.
It is a super-2 number, since 2×1003140252 = 20125807223401250, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100314023) 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 in 35 ways as a sum of consecutive naturals, for example, 18417 + ... + 23233.
It is an arithmetic number, because the mean of its divisors is an integer number (4256703).
Almost surely, 2100314025 is an apocalyptic number.
It is an amenable number.
100314025 is a deficient number, since it is larger than the sum of its proper divisors (52927283).
100314025 is a wasteful number, since it uses less digits than its factorization.
100314025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4858 (or 4846 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 100314025 is about 10015.6889428536. The cubic root of 100314025 is about 464.6442339856.
Adding to 100314025 its reverse (520413001), we get a palindrome (620727026).
The spelling of 100314025 in words is "one hundred million, three hundred fourteen thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •