Base | Representation |
---|---|
bin | 10000100111110001101… |
… | …011010110001000101000 |
3 | 11001012021100100001210201 |
4 | 100213301223112020220 |
5 | 122203232034132402 |
6 | 2232421252121544 |
7 | 145344205231420 |
oct | 20476153261050 |
9 | 4035240301721 |
10 | 1142221005352 |
11 | 40045aa86249 |
12 | 1654536062b4 |
13 | 8393203508b |
14 | 3d3d8a1d480 |
15 | 1eaa2453687 |
hex | 109f1ad6228 |
1142221005352 has 32 divisors (see below), whose sum is σ = 2450137273920. Its totient is φ = 489019121280.
The previous prime is 1142221005349. The next prime is 1142221005377. The reversal of 1142221005352 is 2535001222411.
It is a happy number.
It is a super-2 number, since 2×11422210053522 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 1142221005352.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10448613 + ... + 10557364.
It is an arithmetic number, because the mean of its divisors is an integer number (76566789810).
Almost surely, 21142221005352 is an apocalyptic number.
It is an amenable number.
1142221005352 is an abundant number, since it is smaller than the sum of its proper divisors (1307916268568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1142221005352 is a wasteful number, since it uses less digits than its factorization.
1142221005352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21006961 (or 21006957 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 1142221005352 its reverse (2535001222411), we get a palindrome (3677222227763).
The spelling of 1142221005352 in words is "one trillion, one hundred forty-two billion, two hundred twenty-one million, five thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •