Base | Representation |
---|---|
bin | 101101101101010001011000… |
… | …010100111010101101110101 |
3 | 222100202121211122111012201101 |
4 | 231231101120110322231311 |
5 | 202322030333041402443 |
6 | 1551312430201530101 |
7 | 60225304406113516 |
oct | 5555213024725565 |
9 | 870677748435641 |
10 | 201023131200373 |
11 | 5906348199a469 |
12 | 1a667767aa3931 |
13 | 8822527862821 |
14 | 378d80014ca0d |
15 | 18391163ce84d |
hex | b6d45853ab75 |
201023131200373 has 2 divisors, whose sum is σ = 201023131200374. Its totient is φ = 201023131200372.
The previous prime is 201023131200301. The next prime is 201023131200391. The reversal of 201023131200373 is 373002131320102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 144366905417284 + 56656225783089 = 12015278^2 + 7527033^2 .
It is a cyclic number.
It is not a de Polignac number, because 201023131200373 - 29 = 201023131199861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201023131200673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100511565600186 + 100511565600187.
It is an arithmetic number, because the mean of its divisors is an integer number (100511565600187).
Almost surely, 2201023131200373 is an apocalyptic number.
It is an amenable number.
201023131200373 is a deficient number, since it is larger than the sum of its proper divisors (1).
201023131200373 is an equidigital number, since it uses as much as digits as its factorization.
201023131200373 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 28.
Adding to 201023131200373 its reverse (373002131320102), we get a palindrome (574025262520475).
The spelling of 201023131200373 in words is "two hundred one trillion, twenty-three billion, one hundred thirty-one million, two hundred thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •