Base | Representation |
---|---|
bin | 1010001101101111100011… |
… | …1110011010111000001010 |
3 | 1110202200202010221012201111 |
4 | 2203123320332122320022 |
5 | 2433003020213434310 |
6 | 35515315121240534 |
7 | 2236300066440211 |
oct | 243337076327012 |
9 | 43680663835644 |
10 | 11231221624330 |
11 | 364015289a624 |
12 | 131482949314a |
13 | 63613ac31346 |
14 | 2ab846020078 |
15 | 14723ab1528a |
hex | a36f8f9ae0a |
11231221624330 has 32 divisors (see below), whose sum is σ = 20408086142208. Its totient is φ = 4450038696000.
The previous prime is 11231221624309. The next prime is 11231221624339. The reversal of 11231221624330 is 3342612213211.
It is a super-2 number, since 2×112312216243302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11231221624292 and 11231221624301.
It is not an unprimeable number, because it can be changed into a prime (11231221624339) 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, 11509096 + ... + 12446755.
It is an arithmetic number, because the mean of its divisors is an integer number (637752691944).
Almost surely, 211231221624330 is an apocalyptic number.
11231221624330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11231221624330 is a deficient number, since it is larger than the sum of its proper divisors (9176864517878).
11231221624330 is a wasteful number, since it uses less digits than its factorization.
11231221624330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23956302.
The product of its (nonzero) digits is 10368, while the sum is 31.
Adding to 11231221624330 its reverse (3342612213211), we get a palindrome (14573833837541).
The spelling of 11231221624330 in words is "eleven trillion, two hundred thirty-one billion, two hundred twenty-one million, six hundred twenty-four thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •