Base | Representation |
---|---|
bin | 10011000011110001… |
… | …00010000010011111 |
3 | 222102002120202212110 |
4 | 21201320202002133 |
5 | 131423412102111 |
6 | 4411154205103 |
7 | 511363534464 |
oct | 114170420237 |
9 | 28362522773 |
10 | 10232144031 |
11 | 438086228a |
12 | 1b96883793 |
13 | c70b1a5c5 |
14 | 6d0d1166b |
15 | 3ed4665a6 |
hex | 261e2209f |
10232144031 has 4 divisors (see below), whose sum is σ = 13642858712. Its totient is φ = 6821429352.
The previous prime is 10232144023. The next prime is 10232144063. The reversal of 10232144031 is 13044123201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13044123201 = 3 ⋅4348041067.
It is not a de Polignac number, because 10232144031 - 23 = 10232144023 is a prime.
It is a super-2 number, since 2×102321440312 (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 = 10232143989 and 10232144007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10232144731) 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, 1705357336 + ... + 1705357341.
It is an arithmetic number, because the mean of its divisors is an integer number (3410714678).
Almost surely, 210232144031 is an apocalyptic number.
10232144031 is a deficient number, since it is larger than the sum of its proper divisors (3410714681).
10232144031 is an equidigital number, since it uses as much as digits as its factorization.
10232144031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3410714680.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 10232144031 its reverse (13044123201), we get a palindrome (23276267232).
The spelling of 10232144031 in words is "ten billion, two hundred thirty-two million, one hundred forty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •