Base | Representation |
---|---|
bin | 111100111110011… |
… | …110100010111001 |
3 | 2122021222100021100 |
4 | 330332132202321 |
5 | 4043342323001 |
6 | 245302402013 |
7 | 34231310235 |
oct | 7476364271 |
9 | 2567870240 |
10 | 1023011001 |
11 | 485510341 |
12 | 246730309 |
13 | 133c35c6c |
14 | 99c1b5c5 |
15 | 5ec29586 |
hex | 3cf9e8b9 |
1023011001 has 24 divisors (see below), whose sum is σ = 1487056896. Its totient is φ = 677698560.
The previous prime is 1023010999. The next prime is 1023011009. The reversal of 1023011001 is 1001103201.
It is not a de Polignac number, because 1023011001 - 21 = 1023010999 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1023011009) 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 23 ways as a sum of consecutive naturals, for example, 1595641 + ... + 1596281.
It is an arithmetic number, because the mean of its divisors is an integer number (61960704).
Almost surely, 21023011001 is an apocalyptic number.
It is an amenable number.
1023011001 is a deficient number, since it is larger than the sum of its proper divisors (464045895).
1023011001 is a wasteful number, since it uses less digits than its factorization.
1023011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1493 (or 1490 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 1023011001 is about 31984.5431575941. The cubic root of 1023011001 is about 1007.6122404288.
Adding to 1023011001 its reverse (1001103201), we get a palindrome (2024114202).
It can be divided in two parts, 102 and 3011001, that added together give a palindrome (3011103).
The spelling of 1023011001 in words is "one billion, twenty-three million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •