Base | Representation |
---|---|
bin | 100101100010000000111010… |
… | …1001110101001000010000101 |
3 | 1121021220011002112012100200120 |
4 | 1023010001311032221002011 |
5 | 321232323410222341401 |
6 | 3130043440432132153 |
7 | 126352062256405356 |
oct | 11304016516510205 |
9 | 1537804075170616 |
10 | 330130333012101 |
11 | 9620a540561616 |
12 | 31039578697059 |
13 | 1122920670466b |
14 | 5b745715b5d2d |
15 | 28276aa82b836 |
hex | 12c40753a9085 |
330130333012101 has 16 divisors (see below), whose sum is σ = 466099075998144. Its totient is φ = 207126057323264.
The previous prime is 330130333012097. The next prime is 330130333012127. The reversal of 330130333012101 is 101210333031033.
It is a cyclic number.
It is not a de Polignac number, because 330130333012101 - 22 = 330130333012097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330130333012171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 226513086 + ... + 227965871.
It is an arithmetic number, because the mean of its divisors is an integer number (29131192249884).
Almost surely, 2330130333012101 is an apocalyptic number.
It is an amenable number.
330130333012101 is a deficient number, since it is larger than the sum of its proper divisors (135968742986043).
330130333012101 is a wasteful number, since it uses less digits than its factorization.
330130333012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 454493220.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 330130333012101 its reverse (101210333031033), we get a palindrome (431340666043134).
The spelling of 330130333012101 in words is "three hundred thirty trillion, one hundred thirty billion, three hundred thirty-three million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •