Base | Representation |
---|---|
bin | 1011000111010011111001… |
… | …1111001110011110111101 |
3 | 1121021020112212022001022111 |
4 | 2301310332133032132331 |
5 | 3100204012431032201 |
6 | 41553521334214021 |
7 | 2400611461643230 |
oct | 261647637163675 |
9 | 47236485261274 |
10 | 12220230330301 |
11 | 3991630493644 |
12 | 14544424b4311 |
13 | 6a84940300b6 |
14 | 3036687c1417 |
15 | 162d2245bb51 |
hex | b1d3e7ce7bd |
12220230330301 has 64 divisors (see below), whose sum is σ = 15988376678400. Its totient is φ = 9089806150656.
The previous prime is 12220230330293. The next prime is 12220230330317. The reversal of 12220230330301 is 10303303202221.
It is not a de Polignac number, because 12220230330301 - 23 = 12220230330293 is a prime.
It is a super-3 number, since 3×122202303303013 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220230330331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 49007526 + ... + 49256248.
It is an arithmetic number, because the mean of its divisors is an integer number (249818385600).
Almost surely, 212220230330301 is an apocalyptic number.
It is an amenable number.
12220230330301 is a deficient number, since it is larger than the sum of its proper divisors (3768146348099).
12220230330301 is a wasteful number, since it uses less digits than its factorization.
12220230330301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249418.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 12220230330301 its reverse (10303303202221), we get a palindrome (22523533532522).
The spelling of 12220230330301 in words is "twelve trillion, two hundred twenty billion, two hundred thirty million, three hundred thirty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •