Base | Representation |
---|---|
bin | 1010001101101100001111… |
… | …1010001011111010100101 |
3 | 1110202121110002200011112220 |
4 | 2203123003322023322211 |
5 | 2432444204304301041 |
6 | 35515050515102553 |
7 | 2236236036131520 |
oct | 243330372137245 |
9 | 43677402604486 |
10 | 11230331322021 |
11 | 363a836291299 |
12 | 131461b2a1a59 |
13 | 636028651a46 |
14 | 2ab79daa9bb7 |
15 | 1471d78a1d66 |
hex | a36c3e8bea5 |
11230331322021 has 16 divisors (see below), whose sum is σ = 17112935564928. Its totient is φ = 6417313531200.
The previous prime is 11230331322019. The next prime is 11230331322029. The reversal of 11230331322021 is 12022313303211.
It is not a de Polignac number, because 11230331322021 - 21 = 11230331322019 is a prime.
It is a super-2 number, since 2×112303313220212 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11230331321982 and 11230331322000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11230331322029) 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, 10274251 + ... + 11314631.
It is an arithmetic number, because the mean of its divisors is an integer number (1069558472808).
Almost surely, 211230331322021 is an apocalyptic number.
It is an amenable number.
11230331322021 is a deficient number, since it is larger than the sum of its proper divisors (5882604242907).
11230331322021 is a wasteful number, since it uses less digits than its factorization.
11230331322021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1554412.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 11230331322021 its reverse (12022313303211), we get a palindrome (23252644625232).
The spelling of 11230331322021 in words is "eleven trillion, two hundred thirty billion, three hundred thirty-one million, three hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •