Base | Representation |
---|---|
bin | 10010001100011100111… |
… | …000010011000000111011 |
3 | 11102112021221200010101010 |
4 | 102030130320103000323 |
5 | 130441123410100011 |
6 | 2354220012525003 |
7 | 156222044446353 |
oct | 22143470230073 |
9 | 4375257603333 |
10 | 1250320003131 |
11 | 442292056241 |
12 | 1823a1780763 |
13 | 90b9b73a1a4 |
14 | 44731557b63 |
15 | 227cc6e11a6 |
hex | 1231ce1303b |
1250320003131 has 4 divisors (see below), whose sum is σ = 1667093337512. Its totient is φ = 833546668752.
The previous prime is 1250320003057. The next prime is 1250320003159. The reversal of 1250320003131 is 1313000230521.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1250320003131 - 211 = 1250320001083 is a prime.
It is a super-2 number, since 2×12503200031312 (a number of 25 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 = 1250320003098 and 1250320003107.
It is not an unprimeable number, because it can be changed into a prime (1250320003531) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 208386667186 + ... + 208386667191.
It is an arithmetic number, because the mean of its divisors is an integer number (416773334378).
Almost surely, 21250320003131 is an apocalyptic number.
1250320003131 is a deficient number, since it is larger than the sum of its proper divisors (416773334381).
1250320003131 is an equidigital number, since it uses as much as digits as its factorization.
1250320003131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 416773334380.
The product of its (nonzero) digits is 540, while the sum is 21.
Adding to 1250320003131 its reverse (1313000230521), we get a palindrome (2563320233652).
The spelling of 1250320003131 in words is "one trillion, two hundred fifty billion, three hundred twenty million, three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •