Base | Representation |
---|---|
bin | 101101101111110111111110… |
… | …111100010111110001101100 |
3 | 222101101201120201201222102021 |
4 | 231233313332330113301230 |
5 | 202332443214134020022 |
6 | 1551530533154235524 |
7 | 60244236424516030 |
oct | 5557677674276154 |
9 | 871351521658367 |
10 | 201202020220012 |
11 | 591223300a7659 |
12 | 1a696371585ba4 |
13 | 8836366280536 |
14 | 379833058c1c0 |
15 | 183dad62d37c7 |
hex | b6fdfef17c6c |
201202020220012 has 24 divisors (see below), whose sum is σ = 402542371314720. Its totient is φ = 86199794906880.
The previous prime is 201202020219971. The next prime is 201202020220013. The reversal of 201202020220012 is 210022020202102.
It is a super-3 number, since 3×2012020202200123 (a number of 44 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (201202020220013) 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, 1235014189 + ... + 1235177092.
It is an arithmetic number, because the mean of its divisors is an integer number (16772598804780).
Almost surely, 2201202020220012 is an apocalyptic number.
It is an amenable number.
201202020220012 is an abundant number, since it is smaller than the sum of its proper divisors (201340351094708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201202020220012 is a wasteful number, since it uses less digits than its factorization.
201202020220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2470194201 (or 2470194199 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 201202020220012 its reverse (210022020202102), we get a palindrome (411224040422114).
The spelling of 201202020220012 in words is "two hundred one trillion, two hundred two billion, twenty million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •