Base | Representation |
---|---|
bin | 1001011000011110111011… |
… | …0100100001000011100101 |
3 | 1100112012222100000100101011 |
4 | 2112013232310201003211 |
5 | 2323010111121100424 |
6 | 33535112454102221 |
7 | 2113215425363146 |
oct | 226075664410345 |
9 | 40465870010334 |
10 | 10316223221989 |
11 | 33180a407a0a3 |
12 | 11a742a34a971 |
13 | 59aa7b068469 |
14 | 279444b0bacd |
15 | 12d5369dc694 |
hex | 961eed210e5 |
10316223221989 has 16 divisors (see below), whose sum is σ = 11299889372400. Its totient is φ = 9374437223424.
The previous prime is 10316223221963. The next prime is 10316223222007. The reversal of 10316223221989 is 98912232261301.
It can be written as a sum of positive squares in 8 ways, for example, as 2570811390625 + 7745411831364 = 1603375^2 + 2783058^2 .
It is a cyclic number.
It is not a de Polignac number, because 10316223221989 - 221 = 10316221124837 is a prime.
It is a super-2 number, since 2×103162232219892 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10316223221929) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45398947 + ... + 45625615.
It is an arithmetic number, because the mean of its divisors is an integer number (706243085775).
Almost surely, 210316223221989 is an apocalyptic number.
It is an amenable number.
10316223221989 is a deficient number, since it is larger than the sum of its proper divisors (983666150411).
10316223221989 is a wasteful number, since it uses less digits than its factorization.
10316223221989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319032.
The product of its (nonzero) digits is 559872, while the sum is 49.
The spelling of 10316223221989 in words is "ten trillion, three hundred sixteen billion, two hundred twenty-three million, two hundred twenty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •