Base | Representation |
---|---|
bin | 1010001101110000010011… |
… | …1111110100111111011110 |
3 | 1110202201021012110102012121 |
4 | 2203130010333310333132 |
5 | 2433003423332220110 |
6 | 35515351124253154 |
7 | 2236305066016264 |
oct | 243340477647736 |
9 | 43681235412177 |
10 | 11231423320030 |
11 | 3640246730591 |
12 | 1314884b411ba |
13 | 636170960404 |
14 | 2ab864b24434 |
15 | 14724d6a6cda |
hex | a3704ff4fde |
11231423320030 has 16 divisors (see below), whose sum is σ = 20260415697984. Its totient is φ = 4482824056480.
The previous prime is 11231423320003. The next prime is 11231423320037. The reversal of 11231423320030 is 3002332413211.
It is a super-2 number, since 2×112314233200302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11231423319977 and 11231423320004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11231423320037) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1218154102 + ... + 1218163321.
It is an arithmetic number, because the mean of its divisors is an integer number (1266275981124).
Almost surely, 211231423320030 is an apocalyptic number.
11231423320030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11231423320030 is a deficient number, since it is larger than the sum of its proper divisors (9028992377954).
11231423320030 is a wasteful number, since it uses less digits than its factorization.
11231423320030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2436317891.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 11231423320030 its reverse (3002332413211), we get a palindrome (14233755733241).
The spelling of 11231423320030 in words is "eleven trillion, two hundred thirty-one billion, four hundred twenty-three million, three hundred twenty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •