Base | Representation |
---|---|
bin | 1010010001111111111010… |
… | …0101111011011000110110 |
3 | 1111000200110012211022022122 |
4 | 2210133332211323120312 |
5 | 2440202232024424342 |
6 | 40013045422155542 |
7 | 2244465562145024 |
oct | 244377645733066 |
9 | 44020405738278 |
10 | 11304330311222 |
11 | 3669159837113 |
12 | 1326a31422bb2 |
13 | 63ccbc4259a0 |
14 | 2b11bd851714 |
15 | 1490b90d84d2 |
hex | a47fe97b636 |
11304330311222 has 32 divisors (see below), whose sum is σ = 18372160703232. Its totient is φ = 5185584383904.
The previous prime is 11304330311189. The next prime is 11304330311227. The reversal of 11304330311222 is 22211303340311.
It is a happy number.
It is a super-3 number, since 3×113043303112223 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a junction number, because it is equal to n+sod(n) for n = 11304330311191 and 11304330311200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11304330311227) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41734913 + ... + 42004899.
It is an arithmetic number, because the mean of its divisors is an integer number (574130021976).
Almost surely, 211304330311222 is an apocalyptic number.
11304330311222 is a deficient number, since it is larger than the sum of its proper divisors (7067830392010).
11304330311222 is a wasteful number, since it uses less digits than its factorization.
11304330311222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279812.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 11304330311222 its reverse (22211303340311), we get a palindrome (33515633651533).
The spelling of 11304330311222 in words is "eleven trillion, three hundred four billion, three hundred thirty million, three hundred eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •