Base | Representation |
---|---|
bin | 100101101001000100100011… |
… | …1000100001001111101000001 |
3 | 1121102022212112200210012010111 |
4 | 1023102021013010021331001 |
5 | 321344221223101322241 |
6 | 3132105201452231321 |
7 | 126512126065324432 |
oct | 11322110704117501 |
9 | 1542285480705114 |
10 | 331100221120321 |
11 | 965538a706a534 |
12 | 3117553616b541 |
13 | 1129980338c953 |
14 | 5ba949c7a9489 |
15 | 2842a23715c81 |
hex | 12d2247109f41 |
331100221120321 has 16 divisors (see below), whose sum is σ = 362667116707200. Its totient is φ = 300876797095168.
The previous prime is 331100221120307. The next prime is 331100221120351. The reversal of 331100221120321 is 123021122001133.
It is a cyclic number.
It is not a de Polignac number, because 331100221120321 - 25 = 331100221120289 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 331100221120292 and 331100221120301.
It is not an unprimeable number, because it can be changed into a prime (331100221120351) 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, 124379700 + ... + 127013818.
It is an arithmetic number, because the mean of its divisors is an integer number (22666694794200).
Almost surely, 2331100221120321 is an apocalyptic number.
It is an amenable number.
331100221120321 is a deficient number, since it is larger than the sum of its proper divisors (31566895586879).
331100221120321 is a wasteful number, since it uses less digits than its factorization.
331100221120321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2889128.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 331100221120321 its reverse (123021122001133), we get a palindrome (454121343121454).
The spelling of 331100221120321 in words is "three hundred thirty-one trillion, one hundred billion, two hundred twenty-one million, one hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •