Base | Representation |
---|---|
bin | 100101100001010010101101… |
… | …0101011000001110111010001 |
3 | 1121021112122222000211200200211 |
4 | 1023002211122223001313101 |
5 | 321224212144411034301 |
6 | 3125530110141244121 |
7 | 126341650254165424 |
oct | 11302453253016721 |
9 | 1537478860750624 |
10 | 330031103221201 |
11 | 9618144a969a68 |
12 | 310222a4863641 |
13 | 1121ca51647065 |
14 | 5b6d83a9679bb |
15 | 2824cee032051 |
hex | 12c295aac1dd1 |
330031103221201 has 16 divisors (see below), whose sum is σ = 336353538987648. Its totient is φ = 323768704694400.
The previous prime is 330031103221189. The next prime is 330031103221207. The reversal of 330031103221201 is 102122301130033.
It is a cyclic number.
It is not a de Polignac number, because 330031103221201 - 237 = 329893664267729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (330031103221207) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1749610671 + ... + 1749799291.
It is an arithmetic number, because the mean of its divisors is an integer number (21022096186728).
Almost surely, 2330031103221201 is an apocalyptic number.
It is an amenable number.
330031103221201 is a deficient number, since it is larger than the sum of its proper divisors (6322435766447).
330031103221201 is a wasteful number, since it uses less digits than its factorization.
330031103221201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 347592.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 330031103221201 its reverse (102122301130033), we get a palindrome (432153404351234).
The spelling of 330031103221201 in words is "three hundred thirty trillion, thirty-one billion, one hundred three million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •