Base | Representation |
---|---|
bin | 101110100110000110101… |
… | …011101011100110000100 |
3 | 102100002221121011101111202 |
4 | 232212012223223212010 |
5 | 404430204104430340 |
6 | 10450552211522032 |
7 | 450223540623251 |
oct | 56460653534604 |
9 | 12302847141452 |
10 | 3202010233220 |
11 | 1024a68333947 |
12 | 4386a28b9318 |
13 | 1a2c4346a196 |
14 | b0d99d78428 |
15 | 584593ecc15 |
hex | 2e986aeb984 |
3202010233220 has 48 divisors (see below), whose sum is σ = 7078337616000. Its totient is φ = 1213357397760.
The previous prime is 3202010233199. The next prime is 3202010233307. The reversal of 3202010233220 is 223320102023.
3202010233220 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 3202010233192 and 3202010233201.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15183056 + ... + 15392504.
It is an arithmetic number, because the mean of its divisors is an integer number (147465367000).
Almost surely, 23202010233220 is an apocalyptic number.
It is an amenable number.
3202010233220 is an abundant number, since it is smaller than the sum of its proper divisors (3876327382780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3202010233220 is a wasteful number, since it uses less digits than its factorization.
3202010233220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249708 (or 249706 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 20.
Adding to 3202010233220 its reverse (223320102023), we get a palindrome (3425330335243).
The spelling of 3202010233220 in words is "three trillion, two hundred two billion, ten million, two hundred thirty-three thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •