Base | Representation |
---|---|
bin | 10000010100001101011… |
… | …001011000011111111100 |
3 | 10222012001010201111020000 |
4 | 100110031121120133330 |
5 | 121332220033101022 |
6 | 2215024411354300 |
7 | 144001442065650 |
oct | 20241531303774 |
9 | 3865033644200 |
10 | 1121211222012 |
11 | 3a2559561042 |
12 | 16136b452990 |
13 | 819643a620b |
14 | 3c3a45a0a60 |
15 | 1e272c226ac |
hex | 1050d6587fc |
1121211222012 has 120 divisors (see below), whose sum is σ = 3526096506240. Its totient is φ = 303485732640.
The previous prime is 1121211221989. The next prime is 1121211222067. The reversal of 1121211222012 is 2102221121211.
It is a super-2 number, since 2×11212112220122 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 12966414 + ... + 13052597.
It is an arithmetic number, because the mean of its divisors is an integer number (29384137552).
Almost surely, 21121211222012 is an apocalyptic number.
1121211222012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1121211222012 is an abundant number, since it is smaller than the sum of its proper divisors (2404885284228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1121211222012 is a wasteful number, since it uses less digits than its factorization.
1121211222012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26019053 (or 26019042 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 1121211222012 its reverse (2102221121211), we get a palindrome (3223432343223).
The spelling of 1121211222012 in words is "one trillion, one hundred twenty-one billion, two hundred eleven million, two hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •