Base | Representation |
---|---|
bin | 1010010010000111010000… |
… | …1011111110110100010100 |
3 | 1111000212112201012111202121 |
4 | 2210201310023332310110 |
5 | 2440220302111033022 |
6 | 40014013300345324 |
7 | 2244565506460432 |
oct | 244416413766424 |
9 | 44025481174677 |
10 | 11306303221012 |
11 | 3669a81460478 |
12 | 13272a20a5244 |
13 | 6402450a6627 |
14 | 2b1329897d52 |
15 | 1491823e92c7 |
hex | a48742fed14 |
11306303221012 has 24 divisors (see below), whose sum is σ = 19895666754600. Its totient is φ = 5621828014080.
The previous prime is 11306303221007. The next prime is 11306303221013. The reversal of 11306303221012 is 21012230360311.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 2611565889156 + 8694737331856 = 1616034^2 + 2948684^2 .
It is a super-2 number, since 2×113063032210122 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11306303221013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 79523364 + ... + 79665412.
It is an arithmetic number, because the mean of its divisors is an integer number (828986114775).
Almost surely, 211306303221012 is an apocalyptic number.
It is an amenable number.
11306303221012 is a deficient number, since it is larger than the sum of its proper divisors (8589363533588).
11306303221012 is a wasteful number, since it uses less digits than its factorization.
11306303221012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252171 (or 252169 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 11306303221012 its reverse (21012230360311), we get a palindrome (32318533581323).
The spelling of 11306303221012 in words is "eleven trillion, three hundred six billion, three hundred three million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •