Base | Representation |
---|---|
bin | 10010110101100111… |
… | …00100010010101111 |
3 | 222002211011001110121 |
4 | 21122303210102233 |
5 | 131203012331111 |
6 | 4351313145411 |
7 | 505422333055 |
oct | 113263442257 |
9 | 28084131417 |
10 | 10113402031 |
11 | 431a82a6a7 |
12 | 1b62b5b267 |
13 | c52344175 |
14 | 6bd2421d5 |
15 | 3e2d0d871 |
hex | 25ace44af |
10113402031 has 4 divisors (see below), whose sum is σ = 10113603192. Its totient is φ = 10113200872.
The previous prime is 10113401999. The next prime is 10113402043. The reversal of 10113402031 is 13020431101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13020431101 = 2689 ⋅4842109.
It is a cyclic number.
It is not a de Polignac number, because 10113402031 - 25 = 10113401999 is a prime.
It is a super-2 number, since 2×101134020312 (a number of 21 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 = 10113401996 and 10113402014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10113405031) 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, 47721 + ... + 150013.
It is an arithmetic number, because the mean of its divisors is an integer number (2528400798).
Almost surely, 210113402031 is an apocalyptic number.
10113402031 is a deficient number, since it is larger than the sum of its proper divisors (201161).
10113402031 is an equidigital number, since it uses as much as digits as its factorization.
10113402031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 201160.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10113402031 its reverse (13020431101), we get a palindrome (23133833132).
The spelling of 10113402031 in words is "ten billion, one hundred thirteen million, four hundred two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •