Base | Representation |
---|---|
bin | 111100111110100… |
… | …001010001111001 |
3 | 2122021222220122011 |
4 | 330332201101321 |
5 | 4043343202301 |
6 | 245302525521 |
7 | 34231355005 |
oct | 7476412171 |
9 | 2567886564 |
10 | 1023022201 |
11 | 4855187a3 |
12 | 2467368a1 |
13 | 133c3b0a6 |
14 | 99c21705 |
15 | 5ec2ca51 |
hex | 3cfa1479 |
1023022201 has 4 divisors (see below), whose sum is σ = 1047974004. Its totient is φ = 998070400.
The previous prime is 1023022199. The next prime is 1023022207. The reversal of 1023022201 is 1022203201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 117072400 + 905949801 = 10820^2 + 30099^2 .
It is a cyclic number.
It is not a de Polignac number, because 1023022201 - 21 = 1023022199 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1023022207) 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 3 ways as a sum of consecutive naturals, for example, 12475840 + ... + 12475921.
It is an arithmetic number, because the mean of its divisors is an integer number (261993501).
Almost surely, 21023022201 is an apocalyptic number.
It is an amenable number.
1023022201 is a deficient number, since it is larger than the sum of its proper divisors (24951803).
1023022201 is an equidigital number, since it uses as much as digits as its factorization.
1023022201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24951802.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 1023022201 is about 31984.7182416854. The cubic root of 1023022201 is about 1007.6159175532.
Adding to 1023022201 its reverse (1022203201), we get a palindrome (2045225402).
The spelling of 1023022201 in words is "one billion, twenty-three million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •