Base | Representation |
---|---|
bin | 111100110100101… |
… | …001001011101011 |
3 | 2122010010101002200 |
4 | 330310221023223 |
5 | 4042212330011 |
6 | 245131231243 |
7 | 34200352464 |
oct | 7464511353 |
9 | 2563111080 |
10 | 1020433131 |
11 | 48400a573 |
12 | 2458a8523 |
13 | 1335427b3 |
14 | 99749d6b |
15 | 5e8ba856 |
hex | 3cd292eb |
1020433131 has 12 divisors (see below), whose sum is σ = 1474312008. Its totient is φ = 680125824.
The previous prime is 1020433123. The next prime is 1020433147. The reversal of 1020433131 is 1313340201.
1020433131 is a `hidden beast` number, since 102 + 0 + 433 + 131 = 666.
It is not a de Polignac number, because 1020433131 - 23 = 1020433123 is a prime.
It is a super-2 number, since 2×10204331312 = 2082567549684926322, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1020433831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 35376 + ... + 57378.
It is an arithmetic number, because the mean of its divisors is an integer number (122859334).
Almost surely, 21020433131 is an apocalyptic number.
1020433131 is a deficient number, since it is larger than the sum of its proper divisors (453878877).
1020433131 is a wasteful number, since it uses less digits than its factorization.
1020433131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27162 (or 27159 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 1020433131 is about 31944.2190544706. The cubic root of 1020433131 is about 1006.7651728939.
Adding to 1020433131 its reverse (1313340201), we get a palindrome (2333773332).
The spelling of 1020433131 in words is "one billion, twenty million, four hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •