Base | Representation |
---|---|
bin | 11101110000000100111… |
… | …11011001100011110000 |
3 | 10121201120221102210211011 |
4 | 32320002133121203300 |
5 | 113222023431031112 |
6 | 2101340140400304 |
7 | 133566105435631 |
oct | 16700237314360 |
9 | 3551527383734 |
10 | 1022244002032 |
11 | 3645930a8950 |
12 | 14614b546094 |
13 | 75521840116 |
14 | 37696781888 |
15 | 1b8ce4e1aa7 |
hex | ee027d98f0 |
1022244002032 has 20 divisors (see below), whose sum is σ = 2160652095576. Its totient is φ = 464656364480.
The previous prime is 1022244002011. The next prime is 1022244002033. The reversal of 1022244002032 is 2302004422201.
1022244002032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 = 1022244001994 and 1022244002012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022244002033) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2904102103 + ... + 2904102454.
Almost surely, 21022244002032 is an apocalyptic number.
It is an amenable number.
1022244002032 is an abundant number, since it is smaller than the sum of its proper divisors (1138408093544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022244002032 is a wasteful number, since it uses less digits than its factorization.
1022244002032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5808204576 (or 5808204570 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 22.
Adding to 1022244002032 its reverse (2302004422201), we get a palindrome (3324248424233).
The spelling of 1022244002032 in words is "one trillion, twenty-two billion, two hundred forty-four million, two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •