Base | Representation |
---|---|
bin | 100101100010000000110111… |
… | …0100111001011001110110010 |
3 | 1121021220010210210022111222220 |
4 | 1023010001232213023032302 |
5 | 321232323143313044442 |
6 | 3130043421424541510 |
7 | 126352056441012132 |
oct | 11304015647131662 |
9 | 1537803723274886 |
10 | 330130222003122 |
11 | 9620a493930962 |
12 | 31039547481896 |
13 | 112291b9707c88 |
14 | 5b7456095aac2 |
15 | 28276a0beeeec |
hex | 12c406e9cb3b2 |
330130222003122 has 16 divisors (see below), whose sum is σ = 660567114001440. Its totient is φ = 109992295668512.
The previous prime is 330130222003081. The next prime is 330130222003123. The reversal of 330130222003122 is 221300222031033.
It is a junction number, because it is equal to n+sod(n) for n = 330130222003092 and 330130222003101.
It is not an unprimeable number, because it can be changed into a prime (330130222003123) 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 7 ways as a sum of consecutive naturals, for example, 12777902472 + ... + 12777928307.
It is an arithmetic number, because the mean of its divisors is an integer number (41285444625090).
Almost surely, 2330130222003122 is an apocalyptic number.
330130222003122 is an abundant number, since it is smaller than the sum of its proper divisors (330436891998318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330130222003122 is a wasteful number, since it uses less digits than its factorization.
330130222003122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25555832937.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 330130222003122 its reverse (221300222031033), we get a palindrome (551430444034155).
The spelling of 330130222003122 in words is "three hundred thirty trillion, one hundred thirty billion, two hundred twenty-two million, three thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •