Base | Representation |
---|---|
bin | 11111000010100001111… |
… | …010010101000011110010 |
3 | 21112220200211211012202200 |
4 | 133002201322111003302 |
5 | 234421411132414302 |
6 | 4311521305324030 |
7 | 310051141362522 |
oct | 37024172250362 |
9 | 7486624735680 |
10 | 2133020201202 |
11 | 752677328870 |
12 | 2a5488196616 |
13 | 1261b20742b7 |
14 | 7534b0dd682 |
15 | 3a74107581c |
hex | 1f0a1e950f2 |
2133020201202 has 96 divisors (see below), whose sum is σ = 5200819251264. Its totient is φ = 626284137600.
The previous prime is 2133020201159. The next prime is 2133020201209. The reversal of 2133020201202 is 2021020203312.
2133020201202 is a `hidden beast` number, since 213 + 30 + 20 + 201 + 202 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (2133020201209) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 508713 + ... + 2127164.
It is an arithmetic number, because the mean of its divisors is an integer number (54175200534).
Almost surely, 22133020201202 is an apocalyptic number.
2133020201202 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2133020201202 is an abundant number, since it is smaller than the sum of its proper divisors (3067799050062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2133020201202 is a wasteful number, since it uses less digits than its factorization.
2133020201202 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2636024 (or 2636021 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 2133020201202 its reverse (2021020203312), we get a palindrome (4154040404514).
The spelling of 2133020201202 in words is "two trillion, one hundred thirty-three billion, twenty million, two hundred one thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •