Base | Representation |
---|---|
bin | 1010010100000101111011… |
… | …0011100000000001000110 |
3 | 1111011010022022002020020221 |
4 | 2211001132303200001012 |
5 | 2441244420340021410 |
6 | 40041355220014554 |
7 | 2250211211264146 |
oct | 245013663400106 |
9 | 44133268066227 |
10 | 11340304220230 |
11 | 368243a100427 |
12 | 13319b0b3145a |
13 | 64350334cb8b |
14 | 2b2c33436926 |
15 | 149ec23e44da |
hex | a505ece0046 |
11340304220230 has 16 divisors (see below), whose sum is σ = 20413320192720. Its totient is φ = 4535950000032.
The previous prime is 11340304220191. The next prime is 11340304220233. The reversal of 11340304220230 is 3202240304311.
It is a junction number, because it is equal to n+sod(n) for n = 11340304220195 and 11340304220204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11340304220233) 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, 21183420 + ... + 21712159.
It is an arithmetic number, because the mean of its divisors is an integer number (1275832512045).
Almost surely, 211340304220230 is an apocalyptic number.
11340304220230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11340304220230 is a deficient number, since it is larger than the sum of its proper divisors (9073015972490).
11340304220230 is a wasteful number, since it uses less digits than its factorization.
11340304220230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42922023.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 11340304220230 its reverse (3202240304311), we get a palindrome (14542544524541).
The spelling of 11340304220230 in words is "eleven trillion, three hundred forty billion, three hundred four million, two hundred twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •