Base | Representation |
---|---|
bin | 101111000000001100010… |
… | …100001011001111101001 |
3 | 102102210020210021200222202 |
4 | 233000030110023033221 |
5 | 410410041114201441 |
6 | 10511503541425545 |
7 | 452234646120266 |
oct | 57001424131751 |
9 | 12383223250882 |
10 | 3230022022121 |
11 | 1035932252504 |
12 | 441bbba0b2b5 |
13 | 1a5788954abb |
14 | b249631626d |
15 | 590486e219b |
hex | 2f00c50b3e9 |
3230022022121 has 16 divisors (see below), whose sum is σ = 3406239912960. Its totient is φ = 3054430632960.
The previous prime is 3230022022103. The next prime is 3230022022127. The reversal of 3230022022121 is 1212202200323.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3230022022121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3230022022093 and 3230022022102.
It is not an unprimeable number, because it can be changed into a prime (3230022022127) 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, 24445385 + ... + 24577161.
It is an arithmetic number, because the mean of its divisors is an integer number (212889994560).
Almost surely, 23230022022121 is an apocalyptic number.
It is an amenable number.
3230022022121 is a deficient number, since it is larger than the sum of its proper divisors (176217890839).
3230022022121 is a wasteful number, since it uses less digits than its factorization.
3230022022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 134144.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 3230022022121 its reverse (1212202200323), we get a palindrome (4442224222444).
The spelling of 3230022022121 in words is "three trillion, two hundred thirty billion, twenty-two million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •