Base | Representation |
---|---|
bin | 1010010011000010110111… |
… | …0111100100001101101110 |
3 | 1111002101211210020102111102 |
4 | 2210300231313210031232 |
5 | 2441001034123130410 |
6 | 40025221102323102 |
7 | 2246003142256061 |
oct | 244605567441556 |
9 | 44071753212442 |
10 | 11322303333230 |
11 | 367584207260a |
12 | 132a408589492 |
13 | 6418c4b9b956 |
14 | 2b20068588d8 |
15 | 1497bbe132a5 |
hex | a4c2dde436e |
11322303333230 has 64 divisors (see below), whose sum is σ = 21223707212160. Its totient is φ = 4343616700416.
The previous prime is 11322303333221. The next prime is 11322303333311. The reversal of 11322303333230 is 3233330322311.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 11322303333193 and 11322303333202.
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, 37517519 + ... + 37818101.
It is an arithmetic number, because the mean of its divisors is an integer number (331620425190).
Almost surely, 211322303333230 is an apocalyptic number.
11322303333230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11322303333230 is a deficient number, since it is larger than the sum of its proper divisors (9901403878930).
11322303333230 is a wasteful number, since it uses less digits than its factorization.
11322303333230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301485.
The product of its (nonzero) digits is 17496, while the sum is 29.
Adding to 11322303333230 its reverse (3233330322311), we get a palindrome (14555633655541).
The spelling of 11322303333230 in words is "eleven trillion, three hundred twenty-two billion, three hundred three million, three hundred thirty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •