Base | Representation |
---|---|
bin | 111100111110100… |
… | …001100001111111 |
3 | 2122021222222001022 |
4 | 330332201201333 |
5 | 4043343220411 |
6 | 245302534355 |
7 | 34231361006 |
oct | 7476414177 |
9 | 2567888038 |
10 | 1023023231 |
11 | 48551954a |
12 | 2467373bb |
13 | 133c3b6b9 |
14 | 99c21c3d |
15 | 5ec2cedb |
hex | 3cfa187f |
1023023231 has 4 divisors (see below), whose sum is σ = 1023468600. Its totient is φ = 1022577864.
The previous prime is 1023023203. The next prime is 1023023237. The reversal of 1023023231 is 1323203201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1023023231 - 210 = 1023022207 is a prime.
It is a super-2 number, since 2×10230232312 = 2093153062331358722, 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 (1023023237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 219221 + ... + 223838.
It is an arithmetic number, because the mean of its divisors is an integer number (255867150).
Almost surely, 21023023231 is an apocalyptic number.
1023023231 is a deficient number, since it is larger than the sum of its proper divisors (445369).
1023023231 is an equidigital number, since it uses as much as digits as its factorization.
1023023231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 445368.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 1023023231 is about 31984.7343431206. The cubic root of 1023023231 is about 1007.6162557159.
Adding to 1023023231 its reverse (1323203201), we get a palindrome (2346226432).
The spelling of 1023023231 in words is "one billion, twenty-three million, twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •