Base | Representation |
---|---|
bin | 101111001000000101… |
… | …1100111100001010101 |
3 | 100200020000200212022221 |
4 | 1132100023213201111 |
5 | 3124231010243443 |
6 | 114254144022341 |
7 | 10211624053204 |
oct | 1362013474125 |
9 | 320200625287 |
10 | 101203212373 |
11 | 39a1363639a |
12 | 177449019b1 |
13 | 970ab8a123 |
14 | 4c80b8923b |
15 | 2974babeed |
hex | 17902e7855 |
101203212373 has 2 divisors, whose sum is σ = 101203212374. Its totient is φ = 101203212372.
The previous prime is 101203212371. The next prime is 101203212379. The reversal of 101203212373 is 373212302101.
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., 100975866289 + 227346084 = 317767^2 + 15078^2 .
It is a cyclic number.
It is not a de Polignac number, because 101203212373 - 21 = 101203212371 is a prime.
It is a super-2 number, since 2×1012032123732 (a number of 23 digits) contains 22 as substring.
Together with 101203212371, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101203212371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50601606186 + 50601606187.
It is an arithmetic number, because the mean of its divisors is an integer number (50601606187).
Almost surely, 2101203212373 is an apocalyptic number.
It is an amenable number.
101203212373 is a deficient number, since it is larger than the sum of its proper divisors (1).
101203212373 is an equidigital number, since it uses as much as digits as its factorization.
101203212373 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 25.
Adding to 101203212373 its reverse (373212302101), we get a palindrome (474415514474).
The spelling of 101203212373 in words is "one hundred one billion, two hundred three million, two hundred twelve thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •