Base | Representation |
---|---|
bin | 1010010100000100111010… |
… | …1001000010011100110110 |
3 | 1111011002121101210221222022 |
4 | 2211001032221002130312 |
5 | 2441243341424322410 |
6 | 40041312251433142 |
7 | 2250201406305554 |
oct | 245011651023466 |
9 | 44132541727868 |
10 | 11340033042230 |
11 | 3682310022382 |
12 | 13319361557b2 |
13 | 64348c103b19 |
14 | 2b2c09406bd4 |
15 | 149ea86ca455 |
hex | a504ea42736 |
11340033042230 has 64 divisors (see below), whose sum is σ = 21808740345408. Its totient is φ = 4230494822400.
The previous prime is 11340033042229. The next prime is 11340033042409. The reversal of 11340033042230 is 3224033004311.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11340033042230.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 92396405 + ... + 92519055.
It is an arithmetic number, because the mean of its divisors is an integer number (340761567897).
Almost surely, 211340033042230 is an apocalyptic number.
11340033042230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11340033042230 is a deficient number, since it is larger than the sum of its proper divisors (10468707303178).
11340033042230 is a wasteful number, since it uses less digits than its factorization.
11340033042230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127601.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 11340033042230 its reverse (3224033004311), we get a palindrome (14564066046541).
The spelling of 11340033042230 in words is "eleven trillion, three hundred forty billion, thirty-three million, forty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •