Base | Representation |
---|---|
bin | 101110101110101010011… |
… | …100010100100010111100 |
3 | 102100222200001120001121120 |
4 | 232232222130110202330 |
5 | 410103014212333040 |
6 | 10455112135030540 |
7 | 451000350444123 |
oct | 56565234244274 |
9 | 12328601501546 |
10 | 3211200121020 |
11 | 1028953830641 |
12 | 43a42850b450 |
13 | 1a3a79373b08 |
14 | b15cc69caba |
15 | 587e60d77d0 |
hex | 2ebaa7148bc |
3211200121020 has 96 divisors (see below), whose sum is σ = 9235017792000. Its totient is φ = 833117808384.
The previous prime is 3211200121009. The next prime is 3211200121027. The reversal of 3211200121020 is 201210021123.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3211200121027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 38050831 + ... + 38135129.
It is an arithmetic number, because the mean of its divisors is an integer number (96198102000).
Almost surely, 23211200121020 is an apocalyptic number.
3211200121020 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
3211200121020 is an abundant number, since it is smaller than the sum of its proper divisors (6023817670980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3211200121020 is a wasteful number, since it uses less digits than its factorization.
3211200121020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101507 (or 101505 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 3211200121020 its reverse (201210021123), we get a palindrome (3412410142143).
The spelling of 3211200121020 in words is "three trillion, two hundred eleven billion, two hundred million, one hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •