Base | Representation |
---|---|
bin | 111100100010101… |
… | …0010100111101011 |
3 | 12020120111100020201 |
4 | 1321011102213223 |
5 | 13130021230443 |
6 | 533324333031 |
7 | 101224604542 |
oct | 17105224753 |
9 | 5216440221 |
10 | 2031430123 |
11 | 952764578 |
12 | 4883a4177 |
13 | 264b30278 |
14 | 153b1b159 |
15 | bd52034d |
hex | 791529eb |
2031430123 has 4 divisors (see below), whose sum is σ = 2078672728. Its totient is φ = 1984187520.
The previous prime is 2031430067. The next prime is 2031430133. The reversal of 2031430123 is 3210341302.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2031430123 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 2031430123.
It is not an unprimeable number, because it can be changed into a prime (2031430133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23621238 + ... + 23621323.
It is an arithmetic number, because the mean of its divisors is an integer number (519668182).
Almost surely, 22031430123 is an apocalyptic number.
2031430123 is a deficient number, since it is larger than the sum of its proper divisors (47242605).
2031430123 is an equidigital number, since it uses as much as digits as its factorization.
2031430123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47242604.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 2031430123 is about 45071.3891842708. The cubic root of 2031430123 is about 1266.4866881942.
Adding to 2031430123 its reverse (3210341302), we get a palindrome (5241771425).
The spelling of 2031430123 in words is "two billion, thirty-one million, four hundred thirty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •