Base | Representation |
---|---|
bin | 101110110100010101… |
… | …1011001111101101101 |
3 | 100121111211121101121201 |
4 | 1131220223121331231 |
5 | 3121401324104223 |
6 | 114104310525501 |
7 | 10156325532226 |
oct | 1355053317555 |
9 | 317454541551 |
10 | 100540456813 |
11 | 39703515325 |
12 | 1759a966891 |
13 | 963378b284 |
14 | 4c1ab4824d |
15 | 29368e4ead |
hex | 1768ad9f6d |
100540456813 has 4 divisors (see below), whose sum is σ = 100584001980. Its totient is φ = 100496911648.
The previous prime is 100540456799. The next prime is 100540456859. The reversal of 100540456813 is 318654045001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 91686023209 + 8854433604 = 302797^2 + 94098^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100540456813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100540453813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21769120 + ... + 21773737.
It is an arithmetic number, because the mean of its divisors is an integer number (25146000495).
Almost surely, 2100540456813 is an apocalyptic number.
It is an amenable number.
100540456813 is a deficient number, since it is larger than the sum of its proper divisors (43545167).
100540456813 is an equidigital number, since it uses as much as digits as its factorization.
100540456813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43545166.
The product of its (nonzero) digits is 57600, while the sum is 37.
The spelling of 100540456813 in words is "one hundred billion, five hundred forty million, four hundred fifty-six thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •