Base | Representation |
---|---|
bin | 10111000000110110010100… |
… | …111100001110011100111001 |
3 | 111021100220111002102000010111 |
4 | 113000312110330032130321 |
5 | 101231240022201133131 |
6 | 555132443455144321 |
7 | 30214266324536644 |
oct | 2700662474163471 |
9 | 437326432360114 |
10 | 101213403146041 |
11 | 2a2823aa4a226a |
12 | b427a03b150a1 |
13 | 44624c94a5ba4 |
14 | 1adca7d448a5b |
15 | ba7bd5ee2ab1 |
hex | 5c0d94f0e739 |
101213403146041 has 2 divisors, whose sum is σ = 101213403146042. Its totient is φ = 101213403146040.
The previous prime is 101213403146033. The next prime is 101213403146057. The reversal of 101213403146041 is 140641304312101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93509286800400 + 7704116345641 = 9670020^2 + 2775629^2 .
It is a cyclic number.
It is not a de Polignac number, because 101213403146041 - 23 = 101213403146033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101213403145994 and 101213403146012.
It is not a weakly prime, because it can be changed into another prime (101213403126041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50606701573020 + 50606701573021.
It is an arithmetic number, because the mean of its divisors is an integer number (50606701573021).
Almost surely, 2101213403146041 is an apocalyptic number.
It is an amenable number.
101213403146041 is a deficient number, since it is larger than the sum of its proper divisors (1).
101213403146041 is an equidigital number, since it uses as much as digits as its factorization.
101213403146041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 101213403146041 its reverse (140641304312101), we get a palindrome (241854707458142).
The spelling of 101213403146041 in words is "one hundred one trillion, two hundred thirteen billion, four hundred three million, one hundred forty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •