Base | Representation |
---|---|
bin | 10010001100100011000… |
… | …111000101010011001101 |
3 | 11102112120020101021022101 |
4 | 102030203013011103031 |
5 | 130441332140324123 |
6 | 2354234225315101 |
7 | 156224454145534 |
oct | 22144307052315 |
9 | 4375506337271 |
10 | 1250424542413 |
11 | 442336068142 |
12 | 182410795a91 |
13 | 90bb72acb57 |
14 | 447413ab31b |
15 | 227d6990aad |
hex | 123231c54cd |
1250424542413 has 2 divisors, whose sum is σ = 1250424542414. Its totient is φ = 1250424542412.
The previous prime is 1250424542387. The next prime is 1250424542431. The reversal of 1250424542413 is 3142454240521.
Together with next prime (1250424542431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 856546548004 + 393877994409 = 925498^2 + 627597^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1250424542413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1250424542473) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 625212271206 + 625212271207.
It is an arithmetic number, because the mean of its divisors is an integer number (625212271207).
Almost surely, 21250424542413 is an apocalyptic number.
It is an amenable number.
1250424542413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1250424542413 is an equidigital number, since it uses as much as digits as its factorization.
1250424542413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 153600, while the sum is 37.
Adding to 1250424542413 its reverse (3142454240521), we get a palindrome (4392878782934).
The spelling of 1250424542413 in words is "one trillion, two hundred fifty billion, four hundred twenty-four million, five hundred forty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •