Base | Representation |
---|---|
bin | 11101001010110010100… |
… | …10011111100110011100 |
3 | 10112210220210220110200102 |
4 | 32211121102133212130 |
5 | 112410024200301340 |
6 | 2044225504320232 |
7 | 132260036225222 |
oct | 16453122374634 |
9 | 3483823813612 |
10 | 1002225400220 |
11 | 357050124030 |
12 | 1422a3313078 |
13 | 736813515c5 |
14 | 36717c16b12 |
15 | 1b10bcee215 |
hex | e95949f99c |
1002225400220 has 48 divisors (see below), whose sum is σ = 2370072047616. Its totient is φ = 352689288000.
The previous prime is 1002225400207. The next prime is 1002225400259. The reversal of 1002225400220 is 220045222001.
It is a super-2 number, since 2×10022254002202 (a number of 25 digits) contains 22 as substring.
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 = 1002225400192 and 1002225400201.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 73470116 + ... + 73483755.
It is an arithmetic number, because the mean of its divisors is an integer number (49376500992).
Almost surely, 21002225400220 is an apocalyptic number.
1002225400220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1002225400220 is an abundant number, since it is smaller than the sum of its proper divisors (1367846647396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1002225400220 is a wasteful number, since it uses less digits than its factorization.
1002225400220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 146953922 (or 146953920 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 20.
The spelling of 1002225400220 in words is "one trillion, two billion, two hundred twenty-five million, four hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •