Base | Representation |
---|---|
bin | 101110111001110000111… |
… | …111010111011000011000 |
3 | 102102010102212001010001220 |
4 | 232321300333113120120 |
5 | 410301423002143112 |
6 | 10504403103412040 |
7 | 451601642402265 |
oct | 56716077273030 |
9 | 12363385033056 |
10 | 3223121131032 |
11 | 1032a10940930 |
12 | 4407b48b4020 |
13 | 1a4c2903cbaa |
14 | b1ddd9d826c |
15 | 58c9295398c |
hex | 2ee70fd7618 |
3223121131032 has 32 divisors (see below), whose sum is σ = 8790330358080. Its totient is φ = 976703372960.
The previous prime is 3223121131031. The next prime is 3223121131063. The reversal of 3223121131032 is 2301311213223.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 3223121130993 and 3223121131011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3223121131031) 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, 6104395818 + ... + 6104396345.
It is an arithmetic number, because the mean of its divisors is an integer number (274697823690).
Almost surely, 23223121131032 is an apocalyptic number.
It is an amenable number.
3223121131032 is an abundant number, since it is smaller than the sum of its proper divisors (5567209227048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3223121131032 is a wasteful number, since it uses less digits than its factorization.
3223121131032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12208792183 (or 12208792179 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 3223121131032 its reverse (2301311213223), we get a palindrome (5524432344255).
The spelling of 3223121131032 in words is "three trillion, two hundred twenty-three billion, one hundred twenty-one million, one hundred thirty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •