Base | Representation |
---|---|
bin | 101111010100011110… |
… | …1101110010001001101 |
3 | 100201022000002002021101 |
4 | 1132220331232101031 |
5 | 3131103431003042 |
6 | 114403315503101 |
7 | 10225133152165 |
oct | 1365075562115 |
9 | 321260062241 |
10 | 101619000397 |
11 | 3a107305062 |
12 | 1783bbb7a91 |
13 | 9776068945 |
14 | 4cc009d5a5 |
15 | 299b43d6b7 |
hex | 17a8f6e44d |
101619000397 has 2 divisors, whose sum is σ = 101619000398. Its totient is φ = 101619000396.
The previous prime is 101619000383. The next prime is 101619000451. The reversal of 101619000397 is 793000916101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93575421801 + 8043578596 = 305901^2 + 89686^2 .
It is an emirp because it is prime and its reverse (793000916101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101619000397 - 215 = 101618967629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101619000317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50809500198 + 50809500199.
It is an arithmetic number, because the mean of its divisors is an integer number (50809500199).
Almost surely, 2101619000397 is an apocalyptic number.
It is an amenable number.
101619000397 is a deficient number, since it is larger than the sum of its proper divisors (1).
101619000397 is an equidigital number, since it uses as much as digits as its factorization.
101619000397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10206, while the sum is 37.
Adding to 101619000397 its reverse (793000916101), we get a palindrome (894619916498).
The spelling of 101619000397 in words is "one hundred one billion, six hundred nineteen million, three hundred ninety-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •