Base | Representation |
---|---|
bin | 101011110100011010010… |
… | …110111101100000100100 |
3 | 101122212110200221210200202 |
4 | 223310122112331200210 |
5 | 343313431330114340 |
6 | 10223155512530032 |
7 | 430360461146606 |
oct | 53643226754044 |
9 | 11585420853622 |
10 | 3011214301220 |
11 | a61059a75214 |
12 | 4077156b0918 |
13 | 18ac57c7b0b8 |
14 | a5a5a42d176 |
15 | 534de014c15 |
hex | 2bd1a5bd824 |
3011214301220 has 24 divisors (see below), whose sum is σ = 6324393600000. Its totient is φ = 1204325040992.
The previous prime is 3011214301163. The next prime is 3011214301259. The reversal of 3011214301220 is 221034121103.
3011214301220 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 = 3011214301192 and 3011214301201.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9888740 + ... + 10188699.
It is an arithmetic number, because the mean of its divisors is an integer number (263516400000).
Almost surely, 23011214301220 is an apocalyptic number.
It is an amenable number.
3011214301220 is an abundant number, since it is smaller than the sum of its proper divisors (3313179298780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3011214301220 is a wasteful number, since it uses less digits than its factorization.
3011214301220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20084947 (or 20084945 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 3011214301220 its reverse (221034121103), we get a palindrome (3232248422323).
The spelling of 3011214301220 in words is "three trillion, eleven billion, two hundred fourteen million, three hundred one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •