Base | Representation |
---|---|
bin | 10111000101110001010100… |
… | …010000110010100001001101 |
3 | 111022120020111000220102012002 |
4 | 113011301110100302201031 |
5 | 101302310204312341442 |
6 | 555552100445322045 |
7 | 30250601552211026 |
oct | 2705612420624115 |
9 | 438506430812162 |
10 | 101551620433997 |
11 | 2a3a2889320668 |
12 | b481474266325 |
13 | 4488379c3ab46 |
14 | 1b111a60a1c4d |
15 | bb18cd8e7732 |
hex | 5c5c5443284d |
101551620433997 has 2 divisors, whose sum is σ = 101551620433998. Its totient is φ = 101551620433996.
The previous prime is 101551620433961. The next prime is 101551620434051. The reversal of 101551620433997 is 799334026155101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 74366804657161 + 27184815776836 = 8623619^2 + 5213906^2 .
It is a cyclic number.
It is not a de Polignac number, because 101551620433997 - 26 = 101551620433933 is a prime.
It is a super-2 number, since 2×1015516204339972 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101551620433297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50775810216998 + 50775810216999.
It is an arithmetic number, because the mean of its divisors is an integer number (50775810216999).
Almost surely, 2101551620433997 is an apocalyptic number.
It is an amenable number.
101551620433997 is a deficient number, since it is larger than the sum of its proper divisors (1).
101551620433997 is an equidigital number, since it uses as much as digits as its factorization.
101551620433997 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6123600, while the sum is 56.
The spelling of 101551620433997 in words is "one hundred one trillion, five hundred fifty-one billion, six hundred twenty million, four hundred thirty-three thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •