Base | Representation |
---|---|
bin | 10111001010111111… |
… | …01001011011101111 |
3 | 1012002222110022101012 |
4 | 23211133221123233 |
5 | 200434143310411 |
6 | 5414232535435 |
7 | 620165032145 |
oct | 134537513357 |
9 | 35088408335 |
10 | 12440213231 |
11 | 53041a3366 |
12 | 24b225157b |
13 | 1233415a24 |
14 | 86028d595 |
15 | 4cc22918b |
hex | 2e57e96ef |
12440213231 has 12 divisors (see below), whose sum is σ = 12928931496. Its totient is φ = 11969166960.
The previous prime is 12440213179. The next prime is 12440213249. The reversal of 12440213231 is 13231204421.
It is not a de Polignac number, because 12440213231 - 210 = 12440212207 is a prime.
It is a super-2 number, since 2×124402132312 (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 = 12440213197 and 12440213206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12440513231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 128840 + ... + 203666.
It is an arithmetic number, because the mean of its divisors is an integer number (1077410958).
Almost surely, 212440213231 is an apocalyptic number.
12440213231 is a deficient number, since it is larger than the sum of its proper divisors (488718265).
12440213231 is an equidigital number, since it uses as much as digits as its factorization.
12440213231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75062 (or 75031 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 12440213231 its reverse (13231204421), we get a palindrome (25671417652).
The spelling of 12440213231 in words is "twelve billion, four hundred forty million, two hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •