Base | Representation |
---|---|
bin | 10101001011001101000… |
… | …000001001110100010101 |
3 | 12011002222002110102220201 |
4 | 111023031000021310111 |
5 | 142320110402044131 |
6 | 3032251544100501 |
7 | 210062453413411 |
oct | 25131500116425 |
9 | 5132862412821 |
10 | 1455138315541 |
11 | 511136709909 |
12 | 1b6022a64731 |
13 | a72b0072ba1 |
14 | 50601523d41 |
15 | 27cb8b7d761 |
hex | 152cd009d15 |
1455138315541 has 2 divisors, whose sum is σ = 1455138315542. Its totient is φ = 1455138315540.
The previous prime is 1455138315523. The next prime is 1455138315577.
1455138315541 is nontrivially palindromic in base 10.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1350499652100 + 104638663441 = 1162110^2 + 323479^2 .
It is a palprime.
It is a cyclic number.
It is not a de Polignac number, because 1455138315541 - 213 = 1455138307349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1455138315491 and 1455138315500.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1455138315511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 727569157770 + 727569157771.
It is an arithmetic number, because the mean of its divisors is an integer number (727569157771).
Almost surely, 21455138315541 is an apocalyptic number.
It is an amenable number.
1455138315541 is a deficient number, since it is larger than the sum of its proper divisors (1).
1455138315541 is an equidigital number, since it uses as much as digits as its factorization.
1455138315541 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 720000, while the sum is 46.
The spelling of 1455138315541 in words is "one trillion, four hundred fifty-five billion, one hundred thirty-eight million, three hundred fifteen thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •