Base | Representation |
---|---|
bin | 1011110000100001000… |
… | …0011110110100111100 |
3 | 201022101212101212212110 |
4 | 2330020100132310330 |
5 | 11302200003014322 |
6 | 232444243534020 |
7 | 20410540452144 |
oct | 2741020366474 |
9 | 638355355773 |
10 | 202002001212 |
11 | 78739955360 |
12 | 3319608a310 |
13 | 1608301738b |
14 | 9ac3d3b924 |
15 | 53c40cec0c |
hex | 2f0841ed3c |
202002001212 has 48 divisors (see below), whose sum is σ = 515174010624. Its totient is φ = 61095216000.
The previous prime is 202002001211. The next prime is 202002001217. The reversal of 202002001212 is 212100200202.
It is a super-3 number, since 3×2020020012123 (a number of 35 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202002001211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1399864 + ... + 1537407.
It is an arithmetic number, because the mean of its divisors is an integer number (10732791888).
Almost surely, 2202002001212 is an apocalyptic number.
202002001212 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
202002001212 is an abundant number, since it is smaller than the sum of its proper divisors (313172009412).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202002001212 is a wasteful number, since it uses less digits than its factorization.
202002001212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2937810 (or 2937808 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 202002001212 its reverse (212100200202), we get a palindrome (414102201414).
The spelling of 202002001212 in words is "two hundred two billion, two million, one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •