Base | Representation |
---|---|
bin | 10110011110111100010… |
… | …111001011000010100001 |
3 | 12110201001102122112221201 |
4 | 112132330113023002201 |
5 | 200303232140403101 |
6 | 3141442053321201 |
7 | 216424602431626 |
oct | 26367427130241 |
9 | 5421042575851 |
10 | 1545053450401 |
11 | 54628743651a |
12 | 20b537336201 |
13 | b290c4204b6 |
14 | 54ad105034d |
15 | 2a2cc844e01 |
hex | 167bc5cb0a1 |
1545053450401 has 2 divisors, whose sum is σ = 1545053450402. Its totient is φ = 1545053450400.
The previous prime is 1545053450399. The next prime is 1545053450417. The reversal of 1545053450401 is 1040543505451.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1416756956176 + 128296494225 = 1190276^2 + 358185^2 .
It is an emirp because it is prime and its reverse (1040543505451) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1545053450401 - 21 = 1545053450399 is a prime.
Together with 1545053450399, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1545053454401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 772526725200 + 772526725201.
It is an arithmetic number, because the mean of its divisors is an integer number (772526725201).
Almost surely, 21545053450401 is an apocalyptic number.
It is an amenable number.
1545053450401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1545053450401 is an equidigital number, since it uses as much as digits as its factorization.
1545053450401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120000, while the sum is 37.
Adding to 1545053450401 its reverse (1040543505451), we get a palindrome (2585596955852).
The spelling of 1545053450401 in words is "one trillion, five hundred forty-five billion, fifty-three million, four hundred fifty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •