Base | Representation |
---|---|
bin | 11110000100010101110… |
… | …00100001000010001100 |
3 | 10122202200001201122120011 |
4 | 33002022320201002030 |
5 | 113411313242102340 |
6 | 2110335414403004 |
7 | 134432505665404 |
oct | 17021270410214 |
9 | 3582601648504 |
10 | 1033122222220 |
11 | 369165619770 |
12 | 148286660464 |
13 | 765664696ba |
14 | 380093d1804 |
15 | 1bd195280ea |
hex | f08ae2108c |
1033122222220 has 48 divisors (see below), whose sum is σ = 2402114335488. Its totient is φ = 370073626560.
The previous prime is 1033122222217. The next prime is 1033122222239. The reversal of 1033122222220 is 222222213301.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 1033122222191 and 1033122222200.
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, 35030112 + ... + 35059591.
It is an arithmetic number, because the mean of its divisors is an integer number (50044048656).
Almost surely, 21033122222220 is an apocalyptic number.
1033122222220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1033122222220 is an abundant number, since it is smaller than the sum of its proper divisors (1368992113268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1033122222220 is a wasteful number, since it uses less digits than its factorization.
1033122222220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70089790 (or 70089788 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 1033122222220 its reverse (222222213301), we get a palindrome (1255344435521).
The spelling of 1033122222220 in words is "one trillion, thirty-three billion, one hundred twenty-two million, two hundred twenty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •