Base | Representation |
---|---|
bin | 10010110111101111… |
… | …00101001010101001 |
3 | 222011001200212202122 |
4 | 21123313211022221 |
5 | 131222043401101 |
6 | 4353151241025 |
7 | 506030021534 |
oct | 113367451251 |
9 | 28131625678 |
10 | 10131231401 |
11 | 43298a8115 |
12 | 1b68b19175 |
13 | c55c475a5 |
14 | 6c1763a1b |
15 | 3e468151b |
hex | 25bde52a9 |
10131231401 has 4 divisors (see below), whose sum is σ = 10131945600. Its totient is φ = 10130517204.
The previous prime is 10131231373. The next prime is 10131231437. The reversal of 10131231401 is 10413213101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10131231401 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10131231401.
It is not an unprimeable number, because it can be changed into a prime (10131231491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 335381 + ... + 364338.
It is an arithmetic number, because the mean of its divisors is an integer number (2532986400).
Almost surely, 210131231401 is an apocalyptic number.
It is an amenable number.
10131231401 is a deficient number, since it is larger than the sum of its proper divisors (714199).
10131231401 is an equidigital number, since it uses as much as digits as its factorization.
10131231401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 714198.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10131231401 its reverse (10413213101), we get a palindrome (20544444502).
The spelling of 10131231401 in words is "ten billion, one hundred thirty-one million, two hundred thirty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •