Base | Representation |
---|---|
bin | 1010010011100001001001… |
… | …0101000000001010011110 |
3 | 1111010011211020021222101202 |
4 | 2210320102111000022132 |
5 | 2441114210343104210 |
6 | 40033043411235502 |
7 | 2246411435216045 |
oct | 244702225001236 |
9 | 44104736258352 |
10 | 11330431222430 |
11 | 3679233050011 |
12 | 132bab65a8b92 |
13 | 6425bba6b848 |
14 | 2b25780d355c |
15 | 149ae57719a5 |
hex | a4e1254029e |
11330431222430 has 8 divisors (see below), whose sum is σ = 20394776200392. Its totient is φ = 4532172488968.
The previous prime is 11330431222423. The next prime is 11330431222441. The reversal of 11330431222430 is 3422213403311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11330431222393 and 11330431222402.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 566521561112 + ... + 566521561131.
It is an arithmetic number, because the mean of its divisors is an integer number (2549347025049).
Almost surely, 211330431222430 is an apocalyptic number.
11330431222430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11330431222430 is a deficient number, since it is larger than the sum of its proper divisors (9064344977962).
11330431222430 is a wasteful number, since it uses less digits than its factorization.
11330431222430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1133043122250.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 11330431222430 its reverse (3422213403311), we get a palindrome (14752644625741).
The spelling of 11330431222430 in words is "eleven trillion, three hundred thirty billion, four hundred thirty-one million, two hundred twenty-two thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •