Base | Representation |
---|---|
bin | 1010001101101011000110… |
… | …0010110011100110011110 |
3 | 1110202120122121220010000211 |
4 | 2203122301202303212132 |
5 | 2432443041420000410 |
6 | 35515000151043034 |
7 | 2236225305146146 |
oct | 243326142634636 |
9 | 43676577803024 |
10 | 11230023203230 |
11 | 363a698372067 |
12 | 131455407047a |
13 | 635ca9870730 |
14 | 2ab770bc1926 |
15 | 1471ba7dc68a |
hex | a36b18b399e |
11230023203230 has 64 divisors (see below), whose sum is σ = 23051671675200. Its totient is φ = 3902191663104.
The previous prime is 11230023203221. The next prime is 11230023203251. The reversal of 11230023203230 is 3230232003211.
It is a super-2 number, since 2×112300232032302 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 23715321 + ... + 24184219.
It is an arithmetic number, because the mean of its divisors is an integer number (360182369925).
Almost surely, 211230023203230 is an apocalyptic number.
11230023203230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11230023203230 is an abundant number, since it is smaller than the sum of its proper divisors (11821648471970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11230023203230 is a wasteful number, since it uses less digits than its factorization.
11230023203230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479773.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 11230023203230 its reverse (3230232003211), we get a palindrome (14460255206441).
The spelling of 11230023203230 in words is "eleven trillion, two hundred thirty billion, twenty-three million, two hundred three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •