Base | Representation |
---|---|
bin | 111101100101000… |
… | …111011110100011 |
3 | 2200000000221211022 |
4 | 331211013132203 |
5 | 4103440441011 |
6 | 250303440055 |
7 | 34413355232 |
oct | 7545073643 |
9 | 2600027738 |
10 | 1033140131 |
11 | 4901a9521 |
12 | 249bb602b |
13 | 13607152a |
14 | 9b2d6b19 |
15 | 60a7a8db |
hex | 3d9477a3 |
1033140131 has 4 divisors (see below), whose sum is σ = 1066467264. Its totient is φ = 999813000.
The previous prime is 1033140107. The next prime is 1033140137. The reversal of 1033140131 is 1310413301.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1310413301 = 2269 ⋅577529.
It is a cyclic number.
It is not a de Polignac number, because 1033140131 - 214 = 1033123747 is a prime.
It is a super-2 number, since 2×10331401312 = 2134757060565394322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1033140137) 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, 16663520 + ... + 16663581.
It is an arithmetic number, because the mean of its divisors is an integer number (266616816).
Almost surely, 21033140131 is an apocalyptic number.
1033140131 is a deficient number, since it is larger than the sum of its proper divisors (33327133).
1033140131 is an equidigital number, since it uses as much as digits as its factorization.
1033140131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33327132.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1033140131 is about 32142.4972738585. The cubic root of 1033140131 is about 1010.9268787759.
Adding to 1033140131 its reverse (1310413301), we get a palindrome (2343553432).
The spelling of 1033140131 in words is "one billion, thirty-three million, one hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •