Base | Representation |
---|---|
bin | 10011010001000110… |
… | …10001000100101111 |
3 | 222200220002011011122 |
4 | 21220203101010233 |
5 | 132141031310111 |
6 | 4430232011155 |
7 | 514222430435 |
oct | 115043210457 |
9 | 28626064148 |
10 | 10344010031 |
11 | 4428a18923 |
12 | 2008230abb |
13 | c8b0570c4 |
14 | 701b10d55 |
15 | 4081b1cdb |
hex | 2688d112f |
10344010031 has 4 divisors (see below), whose sum is σ = 10352624064. Its totient is φ = 10335396000.
The previous prime is 10344009989. The next prime is 10344010049. The reversal of 10344010031 is 13001044301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13001044301 = 7 ⋅1857292043.
It is a cyclic number.
It is not a de Polignac number, because 10344010031 - 26 = 10344009967 is a prime.
It is a super-2 number, since 2×103440100312 (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 = 10344009991 and 10344010009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10344010081) 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, 4305215 + ... + 4307616.
It is an arithmetic number, because the mean of its divisors is an integer number (2588156016).
Almost surely, 210344010031 is an apocalyptic number.
10344010031 is a deficient number, since it is larger than the sum of its proper divisors (8614033).
10344010031 is an equidigital number, since it uses as much as digits as its factorization.
10344010031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8614032.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10344010031 its reverse (13001044301), we get a palindrome (23345054332).
The spelling of 10344010031 in words is "ten billion, three hundred forty-four million, ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •