Base | Representation |
---|---|
bin | 1010001101101011001000… |
… | …0100011100101000001111 |
3 | 1110202120200020111011011002 |
4 | 2203122302010130220033 |
5 | 2432443101144201111 |
6 | 35515001104050515 |
7 | 2236225443126014 |
oct | 243326204345017 |
9 | 43676606434132 |
10 | 11230032022031 |
11 | 363a6a2345829 |
12 | 1314557003a3b |
13 | 635cab63a764 |
14 | 2ab77203970b |
15 | 1471bb48063b |
hex | a36b211ca0f |
11230032022031 has 16 divisors (see below), whose sum is σ = 12657078597600. Its totient is φ = 9900648096768.
The previous prime is 11230032022007. The next prime is 11230032022049. The reversal of 11230032022031 is 13022023003211.
It is a cyclic number.
It is not a de Polignac number, because 11230032022031 - 230 = 11228958280207 is a prime.
It is a super-2 number, since 2×112300320220312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11230032021994 and 11230032022012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11230032622031) 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, 195296540 + ... + 195354033.
It is an arithmetic number, because the mean of its divisors is an integer number (791067412350).
Almost surely, 211230032022031 is an apocalyptic number.
11230032022031 is a deficient number, since it is larger than the sum of its proper divisors (1427046575569).
11230032022031 is a wasteful number, since it uses less digits than its factorization.
11230032022031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 390650698.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 11230032022031 its reverse (13022023003211), we get a palindrome (24252055025242).
The spelling of 11230032022031 in words is "eleven trillion, two hundred thirty billion, thirty-two million, twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •