Base | Representation |
---|---|
bin | 11110000010010010011… |
… | …00010101101010110101 |
3 | 10122122211020221011200100 |
4 | 33001021030111222311 |
5 | 113402034122403133 |
6 | 2110034204504313 |
7 | 134363264205156 |
oct | 17011114255265 |
9 | 3578736834610 |
10 | 1032020122293 |
11 | 36874a4aa786 |
12 | 14801954b099 |
13 | 7641c031c74 |
14 | 37d42ca792d |
15 | 1bca28c9e13 |
hex | f049315ab5 |
1032020122293 has 12 divisors (see below), whose sum is σ = 1491153183520. Its totient is φ = 687802283496.
The previous prime is 1032020122271. The next prime is 1032020122333. The reversal of 1032020122293 is 3922210202301.
1032020122293 is a `hidden beast` number, since 10 + 320 + 20 + 1 + 22 + 293 = 666.
It is not a de Polignac number, because 1032020122293 - 28 = 1032020122037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032020122193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17563321 + ... + 17621982.
Almost surely, 21032020122293 is an apocalyptic number.
It is an amenable number.
1032020122293 is a deficient number, since it is larger than the sum of its proper divisors (459133061227).
1032020122293 is a wasteful number, since it uses less digits than its factorization.
1032020122293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35188568 (or 35188565 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 1032020122293 its reverse (3922210202301), we get a palindrome (4954230324594).
The spelling of 1032020122293 in words is "one trillion, thirty-two billion, twenty million, one hundred twenty-two thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •