Base | Representation |
---|---|
bin | 111100110011011… |
… | …101000010001111 |
3 | 2122002112112020211 |
4 | 330303131002033 |
5 | 4042122334411 |
6 | 245120423251 |
7 | 34164613243 |
oct | 7463350217 |
9 | 2562475224 |
10 | 1020121231 |
11 | 4839171a8 |
12 | 245777b27 |
13 | 13346383c |
14 | 996a8423 |
15 | 5e858221 |
hex | 3ccdd08f |
1020121231 has 8 divisors (see below), whose sum is σ = 1065944160. Its totient is φ = 974420832.
The previous prime is 1020121213. The next prime is 1020121241. The reversal of 1020121231 is 1321210201.
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 1020121231 - 211 = 1020119183 is a prime.
It is a super-2 number, since 2×10201212312 = 2081294651873910722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020121241) 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 7 ways as a sum of consecutive naturals, for example, 13396 + ... + 47113.
It is an arithmetic number, because the mean of its divisors is an integer number (133243020).
Almost surely, 21020121231 is an apocalyptic number.
1020121231 is a deficient number, since it is larger than the sum of its proper divisors (45822929).
1020121231 is an equidigital number, since it uses as much as digits as its factorization.
1020121231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61265.
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 1020121231 is about 31939.3367338772. The cubic root of 1020121231 is about 1006.6625883324.
Adding to 1020121231 its reverse (1321210201), we get a palindrome (2341331432).
The spelling of 1020121231 in words is "one billion, twenty million, one hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •