Base | Representation |
---|---|
bin | 101110111001110001100… |
… | …001101100101001001101 |
3 | 102102010110110222100201211 |
4 | 232321301201230221031 |
5 | 410301432303143041 |
6 | 10504404024334421 |
7 | 451602112035313 |
oct | 56716141545115 |
9 | 12363413870654 |
10 | 3223130131021 |
11 | 1032a15a28739 |
12 | 4407b7914411 |
13 | 1a4c2ab71528 |
14 | b2000c9c0b3 |
15 | 58c93630481 |
hex | 2ee7186ca4d |
3223130131021 has 8 divisors (see below), whose sum is σ = 3284156461824. Its totient is φ = 3162111672720.
The previous prime is 3223130130977. The next prime is 3223130131043. The reversal of 3223130131021 is 1201310313223.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3223130131021 - 27 = 3223130130893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3223130130983 and 3223130131001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3223130131051) 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, 1138261 + ... + 2782426.
It is an arithmetic number, because the mean of its divisors is an integer number (410519557728).
Almost surely, 23223130131021 is an apocalyptic number.
It is an amenable number.
3223130131021 is a deficient number, since it is larger than the sum of its proper divisors (61026330803).
3223130131021 is a wasteful number, since it uses less digits than its factorization.
3223130131021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3936251.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 3223130131021 its reverse (1201310313223), we get a palindrome (4424440444244).
The spelling of 3223130131021 in words is "three trillion, two hundred twenty-three billion, one hundred thirty million, one hundred thirty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •