Base | Representation |
---|---|
bin | 10001110000010100010… |
… | …110101011010100110100 |
3 | 11022122022201100210002020 |
4 | 101300110112223110310 |
5 | 124442242210413022 |
6 | 2332302314513140 |
7 | 154102342406415 |
oct | 21602426532464 |
9 | 4278281323066 |
10 | 1220112201012 |
11 | 4304a0590421 |
12 | 1785711357b0 |
13 | 8b0962b8773 |
14 | 430a769980c |
15 | 21b1071b35c |
hex | 11c145ab534 |
1220112201012 has 24 divisors (see below), whose sum is σ = 2848580826336. Its totient is φ = 406468015968.
The previous prime is 1220112200971. The next prime is 1220112201019. The reversal of 1220112201012 is 2101022110221.
It is a junction number, because it is equal to n+sod(n) for n = 1220112200982 and 1220112201000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220112201019) 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, 29484843 + ... + 29526194.
It is an arithmetic number, because the mean of its divisors is an integer number (118690867764).
Almost surely, 21220112201012 is an apocalyptic number.
1220112201012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1220112201012 is an abundant number, since it is smaller than the sum of its proper divisors (1628468625324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220112201012 is a wasteful number, since it uses less digits than its factorization.
1220112201012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59012767 (or 59012765 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1220112201012 its reverse (2101022110221), we get a palindrome (3321134311233).
The spelling of 1220112201012 in words is "one trillion, two hundred twenty billion, one hundred twelve million, two hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •