Base | Representation |
---|---|
bin | 100101110111110101110000… |
… | …1000111110001000111000001 |
3 | 1121200111220211120220101112101 |
4 | 1023233223201013301013001 |
5 | 322131000300230301423 |
6 | 3140301453452030401 |
7 | 130111564463010403 |
oct | 11357534107610701 |
9 | 1550456746811471 |
10 | 333130030322113 |
11 | 9716671a486882 |
12 | 314429b9162401 |
13 | 113b604760425b |
14 | 5c398181d8b73 |
15 | 287a7236ce7ad |
hex | 12efae11f11c1 |
333130030322113 has 16 divisors (see below), whose sum is σ = 355920163986816. Its totient is φ = 311041338854400.
The previous prime is 333130030322083. The next prime is 333130030322123. The reversal of 333130030322113 is 311223030031333.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-333130030322113 is a prime.
It is a super-2 number, since 2×3331300303221132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (333130030322123) 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, 103611870 + ... + 106778647.
It is an arithmetic number, because the mean of its divisors is an integer number (22245010249176).
Almost surely, 2333130030322113 is an apocalyptic number.
It is an amenable number.
333130030322113 is a deficient number, since it is larger than the sum of its proper divisors (22790133664703).
333130030322113 is a wasteful number, since it uses less digits than its factorization.
333130030322113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210392184.
The product of its (nonzero) digits is 8748, while the sum is 28.
Adding to 333130030322113 its reverse (311223030031333), we get a palindrome (644353060353446).
The spelling of 333130030322113 in words is "three hundred thirty-three trillion, one hundred thirty billion, thirty million, three hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •