Base | Representation |
---|---|
bin | 101111001000000000… |
… | …1000001001101010001 |
3 | 100200012211110201010021 |
4 | 1132100001001031101 |
5 | 3124224302342001 |
6 | 114254004303441 |
7 | 10211561332042 |
oct | 1362001011521 |
9 | 320184421107 |
10 | 101200434001 |
11 | 39a12008a17 |
12 | 177439a1b81 |
13 | 970a426614 |
14 | 4c806648c9 |
15 | 297480dba1 |
hex | 1790041351 |
101200434001 has 2 divisors, whose sum is σ = 101200434002. Its totient is φ = 101200434000.
The previous prime is 101200433977. The next prime is 101200434017. The reversal of 101200434001 is 100434002101.
It is an a-pointer prime, because the next prime (101200434017) can be obtained adding 101200434001 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98485502976 + 2714931025 = 313824^2 + 52105^2 .
It is a cyclic number.
It is not a de Polignac number, because 101200434001 - 25 = 101200433969 is a prime.
It is not a weakly prime, because it can be changed into another prime (101200434701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50600217000 + 50600217001.
It is an arithmetic number, because the mean of its divisors is an integer number (50600217001).
Almost surely, 2101200434001 is an apocalyptic number.
It is an amenable number.
101200434001 is a deficient number, since it is larger than the sum of its proper divisors (1).
101200434001 is an equidigital number, since it uses as much as digits as its factorization.
101200434001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 101200434001 its reverse (100434002101), we get a palindrome (201634436102).
The spelling of 101200434001 in words is "one hundred one billion, two hundred million, four hundred thirty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •