Base | Representation |
---|---|
bin | 10110111101110001101010… |
… | …000011000111001000010111 |
3 | 111020121201102002010110111022 |
4 | 112331301222003013020113 |
5 | 101214310031403231041 |
6 | 554451441200431355 |
7 | 30163112263542455 |
oct | 2675615203071027 |
9 | 436551362113438 |
10 | 101002230133271 |
11 | 2a200894873215 |
12 | b3b2aaa61855b |
13 | 444861446396c |
14 | 1ad27694db9d5 |
15 | ba2476c0624b |
hex | 5bdc6a0c7217 |
101002230133271 has 2 divisors, whose sum is σ = 101002230133272. Its totient is φ = 101002230133270.
The previous prime is 101002230133193. The next prime is 101002230133411. The reversal of 101002230133271 is 172331032200101.
It is a weak prime.
It is an emirp because it is prime and its reverse (172331032200101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101002230133271 - 210 = 101002230132247 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101002230133271.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101002230133171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50501115066635 + 50501115066636.
It is an arithmetic number, because the mean of its divisors is an integer number (50501115066636).
Almost surely, 2101002230133271 is an apocalyptic number.
101002230133271 is a deficient number, since it is larger than the sum of its proper divisors (1).
101002230133271 is an equidigital number, since it uses as much as digits as its factorization.
101002230133271 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 26.
Adding to 101002230133271 its reverse (172331032200101), we get a palindrome (273333262333372).
The spelling of 101002230133271 in words is "one hundred one trillion, two billion, two hundred thirty million, one hundred thirty-three thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •