Base | Representation |
---|---|
bin | 101110100110010010110… |
… | …001111111000010011000 |
3 | 102100010110202002210110220 |
4 | 232212102301333002120 |
5 | 404431113040243222 |
6 | 10451024302240040 |
7 | 450231554126112 |
oct | 56462261770230 |
9 | 12303422083426 |
10 | 3202213212312 |
11 | 1025061971064 |
12 | 43873a886020 |
13 | 1a2c7652845a |
14 | b0db8cd43b2 |
15 | 5846c144b5c |
hex | 2e992c7f098 |
3202213212312 has 16 divisors (see below), whose sum is σ = 8005533030840. Its totient is φ = 1067404404096.
The previous prime is 3202213212301. The next prime is 3202213212349. The reversal of 3202213212312 is 2132123122023.
3202213212312 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 (24), and also a Moran number because the ratio is a prime number: 133425550513 = 3202213212312 / (3 + 2 + 0 + 2 + 2 + 1 + 3 + 2 + 1 + 2 + 3 + 1 + 2).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66712775233 + ... + 66712775280.
Almost surely, 23202213212312 is an apocalyptic number.
It is an amenable number.
3202213212312 is an abundant number, since it is smaller than the sum of its proper divisors (4803319818528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3202213212312 is a wasteful number, since it uses less digits than its factorization.
3202213212312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133425550522 (or 133425550518 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 3202213212312 its reverse (2132123122023), we get a palindrome (5334336334335).
The spelling of 3202213212312 in words is "three trillion, two hundred two billion, two hundred thirteen million, two hundred twelve thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •