Base | Representation |
---|---|
bin | 11110000010011111110… |
… | …11010111000101000011 |
3 | 10122200010010112122121011 |
4 | 33001033323113011003 |
5 | 113402302034042011 |
6 | 2110053322341351 |
7 | 134366135461462 |
oct | 17011773270503 |
9 | 3580103478534 |
10 | 1032133112131 |
11 | 3687a8263710 |
12 | 14804b35a857 |
13 | 76439573164 |
14 | 37d53cba9d9 |
15 | 1bcac798621 |
hex | f04fed7143 |
1032133112131 has 4 divisors (see below), whose sum is σ = 1125963395064. Its totient is φ = 938302829200.
The previous prime is 1032133112119. The next prime is 1032133112167. The reversal of 1032133112131 is 1312113312301.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1032133112131 - 215 = 1032133079363 is a prime.
It is a super-2 number, since 2×10321331121312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1032133112111) 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, 46915141450 + ... + 46915141471.
It is an arithmetic number, because the mean of its divisors is an integer number (281490848766).
Almost surely, 21032133112131 is an apocalyptic number.
1032133112131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1032133112131 is a deficient number, since it is larger than the sum of its proper divisors (93830282933).
1032133112131 is an equidigital number, since it uses as much as digits as its factorization.
1032133112131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93830282932.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 1032133112131 its reverse (1312113312301), we get a palindrome (2344246424432).
The spelling of 1032133112131 in words is "one trillion, thirty-two billion, one hundred thirty-three million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •