Base | Representation |
---|---|
bin | 10001011110101110010… |
… | …110111000110011100100 |
3 | 11020211120011102222101020 |
4 | 101132232112320303210 |
5 | 124140100101023022 |
6 | 2315500001131140 |
7 | 152533243655316 |
oct | 21365626706344 |
9 | 4224504388336 |
10 | 1201221111012 |
11 | 42348700194a |
12 | 17497a629ab0 |
13 | 893755911c0 |
14 | 421d47917b6 |
15 | 213a6ee635c |
hex | 117ae5b8ce4 |
1201221111012 has 48 divisors (see below), whose sum is σ = 3031750287552. Its totient is φ = 367978262400.
The previous prime is 1201221111011. The next prime is 1201221111043. The reversal of 1201221111012 is 2101111221021.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1201221110982 and 1201221111000.
It is not an unprimeable number, because it can be changed into a prime (1201221111011) 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, 16925239 + ... + 16996062.
It is an arithmetic number, because the mean of its divisors is an integer number (63161464324).
Almost surely, 21201221111012 is an apocalyptic number.
1201221111012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1201221111012 is an abundant number, since it is smaller than the sum of its proper divisors (1830529176540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201221111012 is a wasteful number, since it uses less digits than its factorization.
1201221111012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33921548 (or 33921546 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1201221111012 its reverse (2101111221021), we get a palindrome (3302332332033).
The spelling of 1201221111012 in words is "one trillion, two hundred one billion, two hundred twenty-one million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •