Base | Representation |
---|---|
bin | 1001101010111110101… |
… | …10100001000111011001 |
3 | 1011202202102001212211111 |
4 | 10311133112201013121 |
5 | 20421033412020441 |
6 | 412355004100321 |
7 | 33003002156620 |
oct | 4653726410731 |
9 | 1152672055744 |
10 | 332312220121 |
11 | 118a29648552 |
12 | 544a28346a1 |
13 | 2544c25709b |
14 | 121266ba6b7 |
15 | 899e2c0081 |
hex | 4d5f5a11d9 |
332312220121 has 8 divisors (see below), whose sum is σ = 384592805120. Its totient is φ = 281233487808.
The previous prime is 332312220113. The next prime is 332312220127. The reversal of 332312220121 is 121022213233.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 332312220121 - 23 = 332312220113 is a prime.
It is a super-2 number, since 2×3323122201212 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 332312220092 and 332312220101.
It is not an unprimeable number, because it can be changed into a prime (332312220127) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 300462576 + ... + 300463681.
It is an arithmetic number, because the mean of its divisors is an integer number (48074100640).
Almost surely, 2332312220121 is an apocalyptic number.
It is an amenable number.
332312220121 is a deficient number, since it is larger than the sum of its proper divisors (52280584999).
332312220121 is an equidigital number, since it uses as much as digits as its factorization.
332312220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600926343.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 332312220121 its reverse (121022213233), we get a palindrome (453334433354).
The spelling of 332312220121 in words is "three hundred thirty-two billion, three hundred twelve million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •