Base | Representation |
---|---|
bin | 10111001001111011… |
… | …10000111110000011 |
3 | 1012002100202001112012 |
4 | 23210331300332003 |
5 | 200424410044303 |
6 | 5413314323135 |
7 | 620026400054 |
oct | 134475607603 |
9 | 35070661465 |
10 | 12431331203 |
11 | 52aa187145 |
12 | 24ab2894ab |
13 | 1231625ca5 |
14 | 85d01a72b |
15 | 4cb5725d8 |
hex | 2e4f70f83 |
12431331203 has 8 divisors (see below), whose sum is σ = 13049503488. Its totient is φ = 11819632264.
The previous prime is 12431331193. The next prime is 12431331239. The reversal of 12431331203 is 30213313421.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12431331203 - 218 = 12431069059 is a prime.
It is a super-3 number, since 3×124313312033 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12431331293) 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 7 ways as a sum of consecutive naturals, for example, 1614401 + ... + 1622082.
It is an arithmetic number, because the mean of its divisors is an integer number (1631187936).
Almost surely, 212431331203 is an apocalyptic number.
12431331203 is a deficient number, since it is larger than the sum of its proper divisors (618172285).
12431331203 is a wasteful number, since it uses less digits than its factorization.
12431331203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3236673.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 12431331203 its reverse (30213313421), we get a palindrome (42644644624).
The spelling of 12431331203 in words is "twelve billion, four hundred thirty-one million, three hundred thirty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •