Base | Representation |
---|---|
bin | 10000011100100101110… |
… | …001110110100101000101 |
3 | 11000001021021221011211201 |
4 | 100130211301312211011 |
5 | 122004132304140303 |
6 | 2223113355302501 |
7 | 144440443253452 |
oct | 20344561664505 |
9 | 4001237834751 |
10 | 1130210224453 |
11 | 3a6357230842 |
12 | 16306114aa31 |
13 | 8276989742b |
14 | 3c9b97d6829 |
15 | 1e5ecca381d |
hex | 10725c76945 |
1130210224453 has 2 divisors, whose sum is σ = 1130210224454. Its totient is φ = 1130210224452.
The previous prime is 1130210224399. The next prime is 1130210224513. The reversal of 1130210224453 is 3544220120311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1124348484609 + 5861739844 = 1060353^2 + 76562^2 .
It is a cyclic number.
It is not a de Polignac number, because 1130210224453 - 233 = 1121620289861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1130210224753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 565105112226 + 565105112227.
It is an arithmetic number, because the mean of its divisors is an integer number (565105112227).
Almost surely, 21130210224453 is an apocalyptic number.
It is an amenable number.
1130210224453 is a deficient number, since it is larger than the sum of its proper divisors (1).
1130210224453 is an equidigital number, since it uses as much as digits as its factorization.
1130210224453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 1130210224453 its reverse (3544220120311), we get a palindrome (4674430344764).
The spelling of 1130210224453 in words is "one trillion, one hundred thirty billion, two hundred ten million, two hundred twenty-four thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •