Base | Representation |
---|---|
bin | 110100110001001111… |
… | …0010110010000110101 |
3 | 101211111112222002112222 |
4 | 1221202132112100311 |
5 | 3324040221203443 |
6 | 124020432052125 |
7 | 11121130631201 |
oct | 1514236262065 |
9 | 354445862488 |
10 | 113321272373 |
11 | 440719a4211 |
12 | 19b67094045 |
13 | a8bc61982a |
14 | 56b0339b01 |
15 | 2e3399d468 |
hex | 1a62796435 |
113321272373 has 2 divisors, whose sum is σ = 113321272374. Its totient is φ = 113321272372.
The previous prime is 113321272369. The next prime is 113321272391. The reversal of 113321272373 is 373272123311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108568273009 + 4752999364 = 329497^2 + 68942^2 .
It is an emirp because it is prime and its reverse (373272123311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113321272373 - 22 = 113321272369 is a prime.
It is a super-2 number, since 2×1133212723732 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113321272313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56660636186 + 56660636187.
It is an arithmetic number, because the mean of its divisors is an integer number (56660636187).
Almost surely, 2113321272373 is an apocalyptic number.
It is an amenable number.
113321272373 is a deficient number, since it is larger than the sum of its proper divisors (1).
113321272373 is an equidigital number, since it uses as much as digits as its factorization.
113321272373 is an evil number, because the sum of its binary digits is even.
The product of its digits is 31752, while the sum is 35.
Adding to 113321272373 its reverse (373272123311), we get a palindrome (486593395684).
The spelling of 113321272373 in words is "one hundred thirteen billion, three hundred twenty-one million, two hundred seventy-two thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •