Base | Representation |
---|---|
bin | 10110110011100101100111… |
… | …101100111111111110001111 |
3 | 111011010210021120200012210000 |
4 | 112303211213230333332033 |
5 | 101121322210421104403 |
6 | 553154053112215343 |
7 | 30061405550215404 |
oct | 2663454754777617 |
9 | 434123246605700 |
10 | 100302111113103 |
11 | 29a60982941a49 |
12 | b2bb27a09a553 |
13 | 43c75aa453ab3 |
14 | 1aaa9104942ab |
15 | b8e14c48d7a3 |
hex | 5b3967b3ff8f |
100302111113103 has 40 divisors (see below), whose sum is σ = 158854695507200. Its totient is φ = 62892955565712.
The previous prime is 100302111113047. The next prime is 100302111113107. The reversal of 100302111113103 is 301311111203001.
100302111113103 is a `hidden beast` number, since 1 + 0 + 0 + 30 + 211 + 111 + 310 + 3 = 666.
It is not a de Polignac number, because 100302111113103 - 29 = 100302111112591 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 (100302111113107) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 234223351 + ... + 234651192.
It is an arithmetic number, because the mean of its divisors is an integer number (3971367387680).
Almost surely, 2100302111113103 is an apocalyptic number.
100302111113103 is a deficient number, since it is larger than the sum of its proper divisors (58552584394097).
100302111113103 is a wasteful number, since it uses less digits than its factorization.
100302111113103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 468874713 (or 468874704 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 100302111113103 its reverse (301311111203001), we get a palindrome (401613222316104).
The spelling of 100302111113103 in words is "one hundred trillion, three hundred two billion, one hundred eleven million, one hundred thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •