Base | Representation |
---|---|
bin | 10110110011111111110100… |
… | …100000110001110000111101 |
3 | 111011020110220011100101211100 |
4 | 112303333310200301300331 |
5 | 101122302314241103123 |
6 | 553215024422443313 |
7 | 30063422646653250 |
oct | 2663776440616075 |
9 | 434213804311740 |
10 | 100330243300413 |
11 | 29a718a9814725 |
12 | b30480b593539 |
13 | 43ca141874a89 |
14 | 1aac01c813097 |
15 | b8ec47116643 |
hex | 5b3ff4831c3d |
100330243300413 has 48 divisors (see below), whose sum is σ = 166717878687360. Its totient is φ = 56953983558528.
The previous prime is 100330243300327. The next prime is 100330243300519. The reversal of 100330243300413 is 314003342033001.
100330243300413 is a `hidden beast` number, since 1 + 0 + 0 + 3 + 3 + 0 + 243 + 3 + 0 + 0 + 413 = 666.
It is not a de Polignac number, because 100330243300413 - 210 = 100330243299389 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100330243300213) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2045331 + ... + 14312367.
It is an arithmetic number, because the mean of its divisors is an integer number (3473289139320).
Almost surely, 2100330243300413 is an apocalyptic number.
It is an amenable number.
100330243300413 is a deficient number, since it is larger than the sum of its proper divisors (66387635386947).
100330243300413 is a wasteful number, since it uses less digits than its factorization.
100330243300413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12267906 (or 12267903 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 27.
Adding to 100330243300413 its reverse (314003342033001), we get a palindrome (414333585333414).
The spelling of 100330243300413 in words is "one hundred trillion, three hundred thirty billion, two hundred forty-three million, three hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •