Base | Representation |
---|---|
bin | 110000011000100001… |
… | …1001100100100110111 |
3 | 100221012010012102101122 |
4 | 1200301003030210313 |
5 | 3200242421333011 |
6 | 115422035214155 |
7 | 10335535406066 |
oct | 1406103144467 |
9 | 327163172348 |
10 | 103902136631 |
11 | 40079058107 |
12 | 1817874735b |
13 | 9a4b088027 |
14 | 50593bc1dd |
15 | 2a81acd3db |
hex | 18310cc937 |
103902136631 has 4 divisors (see below), whose sum is σ = 103934989032. Its totient is φ = 103869284232.
The previous prime is 103902136621. The next prime is 103902136739. The reversal of 103902136631 is 136631209301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 136631209301 = 19 ⋅7191116279.
It is a cyclic number.
It is not a de Polignac number, because 103902136631 - 218 = 103901874487 is a prime.
It is a super-2 number, since 2×1039021366312 (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 = 103902136591 and 103902136600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103902136621) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16421456 + ... + 16427781.
It is an arithmetic number, because the mean of its divisors is an integer number (25983747258).
Almost surely, 2103902136631 is an apocalyptic number.
103902136631 is a deficient number, since it is larger than the sum of its proper divisors (32852401).
103902136631 is an equidigital number, since it uses as much as digits as its factorization.
103902136631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32852400.
The product of its (nonzero) digits is 17496, while the sum is 35.
The spelling of 103902136631 in words is "one hundred three billion, nine hundred two million, one hundred thirty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •