Base | Representation |
---|---|
bin | 10000010110110011101… |
… | …011101010010011010101 |
3 | 10222110020120020111012221 |
4 | 100112303223222103111 |
5 | 121403423231001011 |
6 | 2220205310542341 |
7 | 144130536061654 |
oct | 20266353522325 |
9 | 3873216214187 |
10 | 1124001031381 |
11 | 3a3760309118 |
12 | 161a098079b1 |
13 | 81cba375ba7 |
14 | 3c58acd119b |
15 | 1e387ae7971 |
hex | 105b3aea4d5 |
1124001031381 has 2 divisors, whose sum is σ = 1124001031382. Its totient is φ = 1124001031380.
The previous prime is 1124001031379. The next prime is 1124001031441. The reversal of 1124001031381 is 1831301004211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1123992234225 + 8797156 = 1060185^2 + 2966^2 .
It is a cyclic number.
It is not a de Polignac number, because 1124001031381 - 21 = 1124001031379 is a prime.
It is a super-2 number, since 2×11240010313812 (a number of 25 digits) contains 22 as substring.
Together with 1124001031379, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1124001031301) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 562000515690 + 562000515691.
It is an arithmetic number, because the mean of its divisors is an integer number (562000515691).
Almost surely, 21124001031381 is an apocalyptic number.
It is an amenable number.
1124001031381 is a deficient number, since it is larger than the sum of its proper divisors (1).
1124001031381 is an equidigital number, since it uses as much as digits as its factorization.
1124001031381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 1124001031381 its reverse (1831301004211), we get a palindrome (2955302035592).
The spelling of 1124001031381 in words is "one trillion, one hundred twenty-four billion, one million, thirty-one thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •