Base | Representation |
---|---|
bin | 101111111101111110… |
… | …0111011011010100111 |
3 | 100211220000221021200112 |
4 | 1133323330323122213 |
5 | 3141431343113111 |
6 | 115153413403235 |
7 | 10304500416542 |
oct | 1377374733247 |
9 | 324800837615 |
10 | 103011301031 |
11 | 3a761215141 |
12 | 17b6a33951b |
13 | 993864ca82 |
14 | 4db2d69859 |
15 | 2a2d7b1e8b |
hex | 17fbf3b6a7 |
103011301031 has 8 divisors (see below), whose sum is σ = 103425122544. Its totient is φ = 102597580800.
The previous prime is 103011301013. The next prime is 103011301039. The reversal of 103011301031 is 130103110301.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103011301031 is a prime.
It is a super-2 number, since 2×1030113010312 (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 = 103011300997 and 103011301015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103011301039) 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, 2524316 + ... + 2564798.
It is an arithmetic number, because the mean of its divisors is an integer number (12928140318).
Almost surely, 2103011301031 is an apocalyptic number.
103011301031 is a deficient number, since it is larger than the sum of its proper divisors (413821513).
103011301031 is an equidigital number, since it uses as much as digits as its factorization.
103011301031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50641.
The product of its (nonzero) digits is 27, while the sum is 14.
Adding to 103011301031 its reverse (130103110301), we get a palindrome (233114411332).
The spelling of 103011301031 in words is "one hundred three billion, eleven million, three hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •