Base | Representation |
---|---|
bin | 10111000011110001010101… |
… | …011100000000111011010011 |
3 | 111022002002210001101001022111 |
4 | 113003301111130000323103 |
5 | 101243032241001402324 |
6 | 555405012454250151 |
7 | 30234635306044606 |
oct | 2703612534007323 |
9 | 438062701331274 |
10 | 101414201200339 |
11 | 2a34a580795475 |
12 | b45a902956957 |
13 | 4478419c46431 |
14 | 1b0868b50a33d |
15 | bad039557794 |
hex | 5c3c55700ed3 |
101414201200339 has 2 divisors, whose sum is σ = 101414201200340. Its totient is φ = 101414201200338.
The previous prime is 101414201200331. The next prime is 101414201200441. The reversal of 101414201200339 is 933002102414101.
It is a weak prime.
It is an emirp because it is prime and its reverse (933002102414101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101414201200339 - 23 = 101414201200331 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101414201200339.
It is not a weakly prime, because it can be changed into another prime (101414201200331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50707100600169 + 50707100600170.
It is an arithmetic number, because the mean of its divisors is an integer number (50707100600170).
Almost surely, 2101414201200339 is an apocalyptic number.
101414201200339 is a deficient number, since it is larger than the sum of its proper divisors (1).
101414201200339 is an equidigital number, since it uses as much as digits as its factorization.
101414201200339 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 101414201200339 in words is "one hundred one trillion, four hundred fourteen billion, two hundred one million, two hundred thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •