Base | Representation |
---|---|
bin | 11110000010011110100… |
… | …01000011010100001011 |
3 | 10122200002100200011121101 |
4 | 33001033101003110023 |
5 | 113402241214134011 |
6 | 2110052244522231 |
7 | 134365642266265 |
oct | 17011721032413 |
9 | 3580070604541 |
10 | 1032122021131 |
11 | 3687a1a788a3 |
12 | 1480476b0377 |
13 | 7643718bb36 |
14 | 37d52630b35 |
15 | 1bcab8072c1 |
hex | f04f44350b |
1032122021131 has 8 divisors (see below), whose sum is σ = 1032436668528. Its totient is φ = 1031807436000.
The previous prime is 1032122021107. The next prime is 1032122021159. The reversal of 1032122021131 is 1311202212301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1032122021131 - 221 = 1032119923979 is a prime.
It is a super-2 number, since 2×10321220211312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1032122021099 and 1032122021108.
It is not an unprimeable number, because it can be changed into a prime (1032122021101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76896801 + ... + 76910221.
It is an arithmetic number, because the mean of its divisors is an integer number (129054583566).
Almost surely, 21032122021131 is an apocalyptic number.
1032122021131 is a deficient number, since it is larger than the sum of its proper divisors (314647397).
1032122021131 is a wasteful number, since it uses less digits than its factorization.
1032122021131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31133.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1032122021131 its reverse (1311202212301), we get a palindrome (2343324233432).
The spelling of 1032122021131 in words is "one trillion, thirty-two billion, one hundred twenty-two million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •