Base | Representation |
---|---|
bin | 101111111101101100… |
… | …1100001100010111111 |
3 | 100211212101110202112210 |
4 | 1133323121201202333 |
5 | 3141422004120111 |
6 | 115152442431503 |
7 | 10304325503331 |
oct | 1377331414277 |
9 | 324771422483 |
10 | 103002020031 |
11 | 3a756a56199 |
12 | 17b67202593 |
13 | 9936750561 |
14 | 4db1a31451 |
15 | 2a2ca7c0a6 |
hex | 17fb6618bf |
103002020031 has 32 divisors (see below), whose sum is σ = 154528980480. Its totient is φ = 60707750400.
The previous prime is 103002020003. The next prime is 103002020059. The reversal of 103002020031 is 130020200301.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (103002020003) and next prime (103002020059).
It is not a de Polignac number, because 103002020031 - 25 = 103002019999 is a prime.
It is a super-2 number, since 2×1030020200312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103002019989 and 103002020016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103002020071) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 904390 + ... + 1011891.
It is an arithmetic number, because the mean of its divisors is an integer number (4829030640).
Almost surely, 2103002020031 is an apocalyptic number.
103002020031 is a deficient number, since it is larger than the sum of its proper divisors (51526960449).
103002020031 is a wasteful number, since it uses less digits than its factorization.
103002020031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1916367.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 103002020031 its reverse (130020200301), we get a palindrome (233022220332).
The spelling of 103002020031 in words is "one hundred three billion, two million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •