Base | Representation |
---|---|
bin | 110000000001100110… |
… | …1100101111100001111 |
3 | 100212012112010211012222 |
4 | 1200003031211330033 |
5 | 3142204034010111 |
6 | 115213444245555 |
7 | 10310506654040 |
oct | 1400315457417 |
9 | 325175124188 |
10 | 103133110031 |
11 | 3a813a52036 |
12 | 17ba30a08bb |
13 | 995795b1c3 |
14 | 4dc51d68c7 |
15 | 2a393237db |
hex | 1803365f0f |
103133110031 has 8 divisors (see below), whose sum is σ = 121930770720. Its totient is φ = 85351539168.
The previous prime is 103133109929. The next prime is 103133110039. The reversal of 103133110031 is 130011331301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-103133110031 is a prime.
It is a super-2 number, since 2×1031331100312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103133109991 and 103133110009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103133110039) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 254022236 + ... + 254022641.
It is an arithmetic number, because the mean of its divisors is an integer number (15241346340).
Almost surely, 2103133110031 is an apocalyptic number.
103133110031 is a deficient number, since it is larger than the sum of its proper divisors (18797660689).
103133110031 is an equidigital number, since it uses as much as digits as its factorization.
103133110031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 508044913.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 103133110031 its reverse (130011331301), we get a palindrome (233144441332).
The spelling of 103133110031 in words is "one hundred three billion, one hundred thirty-three million, one hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •