Base | Representation |
---|---|
bin | 10111000011100100001110… |
… | …010010000101111001011001 |
3 | 111022000202102212211201210101 |
4 | 113003210032102011321121 |
5 | 101242314422330440113 |
6 | 555354323451215401 |
7 | 30233626364150056 |
oct | 2703441622057131 |
9 | 438022385751711 |
10 | 101400122515033 |
11 | 2a344606733861 |
12 | b458033a47561 |
13 | 4476cb5247704 |
14 | 1b07b137d002d |
15 | bac9b35802dd |
hex | 5c390e485e59 |
101400122515033 has 2 divisors, whose sum is σ = 101400122515034. Its totient is φ = 101400122515032.
The previous prime is 101400122515019. The next prime is 101400122515073. The reversal of 101400122515033 is 330515221004101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 55679697905689 + 45720424609344 = 7461883^2 + 6761688^2 .
It is a cyclic number.
It is not a de Polignac number, because 101400122515033 - 245 = 66215750426201 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101400122514992 and 101400122515010.
It is not a weakly prime, because it can be changed into another prime (101400122515073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50700061257516 + 50700061257517.
It is an arithmetic number, because the mean of its divisors is an integer number (50700061257517).
Almost surely, 2101400122515033 is an apocalyptic number.
It is an amenable number.
101400122515033 is a deficient number, since it is larger than the sum of its proper divisors (1).
101400122515033 is an equidigital number, since it uses as much as digits as its factorization.
101400122515033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 101400122515033 its reverse (330515221004101), we get a palindrome (431915343519134).
The spelling of 101400122515033 in words is "one hundred one trillion, four hundred billion, one hundred twenty-two million, five hundred fifteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •