Base | Representation |
---|---|
bin | 111101011101000… |
… | …010001001001011 |
3 | 2122212001022002211 |
4 | 331131002021023 |
5 | 4102420134011 |
6 | 250150205551 |
7 | 34356351340 |
oct | 7535021113 |
9 | 2585038084 |
10 | 1031021131 |
11 | 489a91488 |
12 | 2493538b7 |
13 | 1357abb9a |
14 | 9ad047c7 |
15 | 607acb21 |
hex | 3d74224b |
1031021131 has 8 divisors (see below), whose sum is σ = 1179872480. Its totient is φ = 882560448.
The previous prime is 1031021119. The next prime is 1031021141. The reversal of 1031021131 is 1311201301.
1031021131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1031021131 - 29 = 1031020619 is a prime.
It is a super-2 number, since 2×10310211312 = 2126009145137038322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1031021141) 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, 91986 + ... + 102583.
It is an arithmetic number, because the mean of its divisors is an integer number (147484060).
Almost surely, 21031021131 is an apocalyptic number.
1031021131 is a deficient number, since it is larger than the sum of its proper divisors (148851349).
1031021131 is an equidigital number, since it uses as much as digits as its factorization.
1031021131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195333.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1031021131 is about 32109.5177634296. The cubic root of 1031021131 is about 1010.2352590550.
Adding to 1031021131 its reverse (1311201301), we get a palindrome (2342222432).
The spelling of 1031021131 in words is "one billion, thirty-one million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •