Base | Representation |
---|---|
bin | 1011111101100011100011… |
… | …0001101101100010101001 |
3 | 1201120022222102022001110022 |
4 | 2333120320301231202221 |
5 | 3210441041424303131 |
6 | 43550002200330225 |
7 | 2525132230656506 |
oct | 277307061554251 |
9 | 51508872261408 |
10 | 13152142416041 |
11 | 4210879577812 |
12 | 1584b81a73975 |
13 | 74531b056b75 |
14 | 3367d21444ad |
15 | 17c1b63ab37b |
hex | bf638c6d8a9 |
13152142416041 has 2 divisors, whose sum is σ = 13152142416042. Its totient is φ = 13152142416040.
The previous prime is 13152142416013. The next prime is 13152142416053. The reversal of 13152142416041 is 14061424125131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9321902006041 + 3830240410000 = 3053179^2 + 1957100^2 .
It is a cyclic number.
It is not a de Polignac number, because 13152142416041 - 214 = 13152142399657 is a prime.
It is a super-2 number, since 2×131521424160412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13152142415992 and 13152142416010.
It is not a weakly prime, because it can be changed into another prime (13152142410041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6576071208020 + 6576071208021.
It is an arithmetic number, because the mean of its divisors is an integer number (6576071208021).
Almost surely, 213152142416041 is an apocalyptic number.
It is an amenable number.
13152142416041 is a deficient number, since it is larger than the sum of its proper divisors (1).
13152142416041 is an equidigital number, since it uses as much as digits as its factorization.
13152142416041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23040, while the sum is 35.
The spelling of 13152142416041 in words is "thirteen trillion, one hundred fifty-two billion, one hundred forty-two million, four hundred sixteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •