Base | Representation |
---|---|
bin | 101101110000001001101011… |
… | …011010110010011011010010 |
3 | 222101110112121212011220111112 |
4 | 231300021223122302123102 |
5 | 202333301122110031002 |
6 | 1551543354353413322 |
7 | 60245511313143320 |
oct | 5560115332623322 |
9 | 871415555156445 |
10 | 201221020002002 |
11 | 5912a39aa74020 |
12 | 1a699b9456a242 |
13 | 88380a36729a0 |
14 | 3799213aaad10 |
15 | 183e349328852 |
hex | b7026b6b26d2 |
201221020002002 has 64 divisors (see below), whose sum is σ = 419230675987200. Its totient is φ = 69871779290880.
The previous prime is 201221020001941. The next prime is 201221020002017. The reversal of 201221020002002 is 200200020122102.
201221020002002 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 (14).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1732872977 + ... + 1732989092.
It is an arithmetic number, because the mean of its divisors is an integer number (6550479312300).
Almost surely, 2201221020002002 is an apocalyptic number.
201221020002002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201221020002002 is an abundant number, since it is smaller than the sum of its proper divisors (218009655985198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201221020002002 is a wasteful number, since it uses less digits than its factorization.
201221020002002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3465862131.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 201221020002002 its reverse (200200020122102), we get a palindrome (401421040124104).
The spelling of 201221020002002 in words is "two hundred one trillion, two hundred twenty-one billion, twenty million, two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •