Base | Representation |
---|---|
bin | 10111011111010000101100… |
… | …100111110010111011011001 |
3 | 111112202200212201212111100122 |
4 | 113133100230213302323121 |
5 | 102020010130310024423 |
6 | 1003412514245243025 |
7 | 30521263061142500 |
oct | 2737205447627331 |
9 | 445680781774318 |
10 | 103303302033113 |
11 | 2aa08758982536 |
12 | b704a56a03475 |
13 | 45845c89192a0 |
14 | 1b71c995d5837 |
15 | be22515278c8 |
hex | 5df42c9f2ed9 |
103303302033113 has 48 divisors (see below), whose sum is σ = 131288032665216. Its totient is φ = 80551950716160.
The previous prime is 103303302033013. The next prime is 103303302033161. The reversal of 103303302033113 is 311330203303301.
It is a happy number.
It is not a de Polignac number, because 103303302033113 - 238 = 103028424126169 is a prime.
It is not an unprimeable number, because it can be changed into a prime (103303302033013) 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, 58795028 + ... + 60526538.
It is an arithmetic number, because the mean of its divisors is an integer number (2735167347192).
Almost surely, 2103303302033113 is an apocalyptic number.
103303302033113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
103303302033113 is a deficient number, since it is larger than the sum of its proper divisors (27984730632103).
103303302033113 is a wasteful number, since it uses less digits than its factorization.
103303302033113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1732894 (or 1732887 counting only the distinct ones).
The product of its (nonzero) digits is 4374, while the sum is 26.
Adding to 103303302033113 its reverse (311330203303301), we get a palindrome (414633505336414).
The spelling of 103303302033113 in words is "one hundred three trillion, three hundred three billion, three hundred two million, thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •