Base | Representation |
---|---|
bin | 10101001000010110… |
… | …01001111010110110 |
3 | 1002021121100021112121 |
4 | 22210023021322312 |
5 | 141213121302410 |
6 | 5113404110154 |
7 | 551060101513 |
oct | 124413117266 |
9 | 32247307477 |
10 | 11344322230 |
11 | 48a163521a |
12 | 224723535a |
13 | 10ba373407 |
14 | 79890030a |
15 | 465e059da |
hex | 2a42c9eb6 |
11344322230 has 16 divisors (see below), whose sum is σ = 20459906640. Its totient is φ = 4528811872.
The previous prime is 11344322219. The next prime is 11344322239. The reversal of 11344322230 is 3222344311.
11344322230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11344322195 and 11344322204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11344322239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1109284 + ... + 1119463.
It is an arithmetic number, because the mean of its divisors is an integer number (1278744165).
Almost surely, 211344322230 is an apocalyptic number.
11344322230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11344322230 is a deficient number, since it is larger than the sum of its proper divisors (9115584410).
11344322230 is a wasteful number, since it uses less digits than its factorization.
11344322230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2229263.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 11344322230 its reverse (3222344311), we get a palindrome (14566666541).
The spelling of 11344322230 in words is "eleven billion, three hundred forty-four million, three hundred twenty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •