Base | Representation |
---|---|
bin | 10110110100010101… |
… | …00100001101010111 |
3 | 1011121201210110101202 |
4 | 23122022210031113 |
5 | 200042013344211 |
6 | 5343322543115 |
7 | 612366310250 |
oct | 133212441527 |
9 | 34551713352 |
10 | 12250137431 |
11 | 5216979624 |
12 | 245a667a9b |
13 | 1202c2493c |
14 | 842d31b27 |
15 | 4ba6d053b |
hex | 2da2a4357 |
12250137431 has 16 divisors (see below), whose sum is σ = 14344222464. Its totient is φ = 10242699264.
The previous prime is 12250137409. The next prime is 12250137461. The reversal of 12250137431 is 13473105221.
12250137431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 12250137431 - 210 = 12250136407 is a prime.
It is a super-2 number, since 2×122501374312 (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 = 12250137394 and 12250137403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12250137461) 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 15 ways as a sum of consecutive naturals, for example, 211031 + ... + 262743.
It is an arithmetic number, because the mean of its divisors is an integer number (896513904).
Almost surely, 212250137431 is an apocalyptic number.
12250137431 is a deficient number, since it is larger than the sum of its proper divisors (2094085033).
12250137431 is an equidigital number, since it uses as much as digits as its factorization.
12250137431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52550.
The product of its (nonzero) digits is 5040, while the sum is 29.
The spelling of 12250137431 in words is "twelve billion, two hundred fifty million, one hundred thirty-seven thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •