Base | Representation |
---|---|
bin | 101111001011101010… |
… | …0101000000011000101 |
3 | 100200112101010102201212 |
4 | 1132113110220003011 |
5 | 3130002142424331 |
6 | 114314103501205 |
7 | 10214610261113 |
oct | 1362724500305 |
9 | 320471112655 |
10 | 101323014341 |
11 | 39a7522238a |
12 | 17778a57805 |
13 | 9729944b73 |
14 | 4c92a52ab3 |
15 | 2980473d2b |
hex | 17975280c5 |
101323014341 has 2 divisors, whose sum is σ = 101323014342. Its totient is φ = 101323014340.
The previous prime is 101323014337. The next prime is 101323014371. The reversal of 101323014341 is 143410323101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 52723048225 + 48599966116 = 229615^2 + 220454^2 .
It is an emirp because it is prime and its reverse (143410323101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101323014341 - 22 = 101323014337 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101323014301) 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, 50661507170 + 50661507171.
It is an arithmetic number, because the mean of its divisors is an integer number (50661507171).
Almost surely, 2101323014341 is an apocalyptic number.
It is an amenable number.
101323014341 is a deficient number, since it is larger than the sum of its proper divisors (1).
101323014341 is an equidigital number, since it uses as much as digits as its factorization.
101323014341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 101323014341 its reverse (143410323101), we get a palindrome (244733337442).
The spelling of 101323014341 in words is "one hundred one billion, three hundred twenty-three million, fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •