Base | Representation |
---|---|
bin | 10101001000010101001… |
… | …011100111000011000111 |
3 | 12010211000011100210011102 |
4 | 111020111023213003013 |
5 | 142242301400423421 |
6 | 3031021535130315 |
7 | 206623154666015 |
oct | 25102513470307 |
9 | 5124004323142 |
10 | 1452054311111 |
11 | 50a8a3892718 |
12 | 1b550207399b |
13 | a6c0b1586b1 |
14 | 503cbad18b5 |
15 | 27b8804460b |
hex | 152152e70c7 |
1452054311111 has 2 divisors, whose sum is σ = 1452054311112. Its totient is φ = 1452054311110.
The previous prime is 1452054311101. The next prime is 1452054311161. The reversal of 1452054311111 is 1111134502541.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1452054311111 - 26 = 1452054311047 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1452054311101) 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, 726027155555 + 726027155556.
It is an arithmetic number, because the mean of its divisors is an integer number (726027155556).
Almost surely, 21452054311111 is an apocalyptic number.
1452054311111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1452054311111 is an equidigital number, since it uses as much as digits as its factorization.
1452054311111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 29.
Adding to 1452054311111 its reverse (1111134502541), we get a palindrome (2563188813652).
The spelling of 1452054311111 in words is "one trillion, four hundred fifty-two billion, fifty-four million, three hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •