Base | Representation |
---|---|
bin | 110000000111100000… |
… | …0100110010001110011 |
3 | 100212201022120012120001 |
4 | 1200033000212101303 |
5 | 3143110220431011 |
6 | 115245234330431 |
7 | 10315432156420 |
oct | 1401700462163 |
9 | 325638505501 |
10 | 103331030131 |
11 | 3a90574436a |
12 | 18039429a17 |
13 | 99899678a4 |
14 | 50035d6d47 |
15 | 2a4b8bb7c1 |
hex | 180f026473 |
103331030131 has 8 divisors (see below), whose sum is σ = 118127458304. Its totient is φ = 88543315080.
The previous prime is 103331030029. The next prime is 103331030137. The reversal of 103331030131 is 131030133301.
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 not a de Polignac number, because 103331030131 - 27 = 103331030003 is a prime.
It is a super-2 number, since 2×1033310301312 (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 = 103331030099 and 103331030108.
It is not an unprimeable number, because it can be changed into a prime (103331030137) 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, 2152845 + ... + 2200318.
It is an arithmetic number, because the mean of its divisors is an integer number (14765932288).
Almost surely, 2103331030131 is an apocalyptic number.
103331030131 is a deficient number, since it is larger than the sum of its proper divisors (14796428173).
103331030131 is an equidigital number, since it uses as much as digits as its factorization.
103331030131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4356561.
The product of its (nonzero) digits is 243, while the sum is 19.
Adding to 103331030131 its reverse (131030133301), we get a palindrome (234361163432).
The spelling of 103331030131 in words is "one hundred three billion, three hundred thirty-one million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •