Base | Representation |
---|---|
bin | 11110000100001000100… |
… | …00010100110010101110 |
3 | 10122202101022111010221100 |
4 | 33002010100110302232 |
5 | 113411101310214042 |
6 | 2110320403143530 |
7 | 134426655550446 |
oct | 17020420246256 |
9 | 3582338433840 |
10 | 1033011023022 |
11 | 369108879100 |
12 | 148255374ba6 |
13 | 76549404564 |
14 | 37dd8727126 |
15 | 1bd0e8b024c |
hex | f084414cae |
1033011023022 has 36 divisors (see below), whose sum is σ = 2460159865800. Its totient is φ = 313033642680.
The previous prime is 1033011022991. The next prime is 1033011023071. The reversal of 1033011023022 is 2203201103301.
1033011023022 is a `hidden beast` number, since 103 + 301 + 10 + 230 + 22 = 666.
It is a super-2 number, since 2×10330110230222 (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 junction number, because it is equal to n+sod(n) for n = 1033011022986 and 1033011023004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 237144522 + ... + 237148877.
It is an arithmetic number, because the mean of its divisors is an integer number (68337774050).
Almost surely, 21033011023022 is an apocalyptic number.
1033011023022 is an abundant number, since it is smaller than the sum of its proper divisors (1427148842778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1033011023022 is a wasteful number, since it uses less digits than its factorization.
1033011023022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 474293429 (or 474293415 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 1033011023022 its reverse (2203201103301), we get a palindrome (3236212126323).
The spelling of 1033011023022 in words is "one trillion, thirty-three billion, eleven million, twenty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •