Base | Representation |
---|---|
bin | 1001010001110101011011… |
… | …0101001100001111110101 |
3 | 1100010022011012121101122222 |
4 | 2110131112311030033311 |
5 | 2314122201023043443 |
6 | 33410422550132125 |
7 | 2102033113101443 |
oct | 224352665141765 |
9 | 40108135541588 |
10 | 10202004112373 |
11 | 32837113a0537 |
12 | 1189272651045 |
13 | 5900777317b8 |
14 | 273acb459b93 |
15 | 12a59e2dd468 |
hex | 94756d4c3f5 |
10202004112373 has 2 divisors, whose sum is σ = 10202004112374. Its totient is φ = 10202004112372.
The previous prime is 10202004112367. The next prime is 10202004112441. The reversal of 10202004112373 is 37321140020201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9560111515249 + 641892597124 = 3091943^2 + 801182^2 .
It is a cyclic number.
It is not a de Polignac number, because 10202004112373 - 220 = 10202003063797 is a prime.
It is a super-2 number, since 2×102020041123732 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10202004112673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5101002056186 + 5101002056187.
It is an arithmetic number, because the mean of its divisors is an integer number (5101002056187).
Almost surely, 210202004112373 is an apocalyptic number.
It is an amenable number.
10202004112373 is a deficient number, since it is larger than the sum of its proper divisors (1).
10202004112373 is an equidigital number, since it uses as much as digits as its factorization.
10202004112373 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2016, while the sum is 26.
Adding to 10202004112373 its reverse (37321140020201), we get a palindrome (47523144132574).
The spelling of 10202004112373 in words is "ten trillion, two hundred two billion, four million, one hundred twelve thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •