Base | Representation |
---|---|
bin | 111100111111101… |
… | …010101110000101 |
3 | 2122022120012021100 |
4 | 330333222232011 |
5 | 4043432314023 |
6 | 245313210313 |
7 | 34234050006 |
oct | 7477525605 |
9 | 2568505240 |
10 | 1023323013 |
11 | 4857037a9 |
12 | 246860999 |
13 | 134014c9b |
14 | 99c9d1ad |
15 | 5ec8bc43 |
hex | 3cfeab85 |
1023323013 has 12 divisors (see below), whose sum is σ = 1478437740. Its totient is φ = 682074816.
The previous prime is 1023322997. The next prime is 1023323027. The reversal of 1023323013 is 3103233201.
It can be written as a sum of positive squares in 2 ways, for example, as 469285569 + 554037444 = 21663^2 + 23538^2 .
It is not a de Polignac number, because 1023323013 - 24 = 1023322997 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1023327013) 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 11 ways as a sum of consecutive naturals, for example, 53545 + ... + 70097.
It is an arithmetic number, because the mean of its divisors is an integer number (123203145).
Almost surely, 21023323013 is an apocalyptic number.
It is an amenable number.
1023323013 is a deficient number, since it is larger than the sum of its proper divisors (455114727).
1023323013 is a wasteful number, since it uses less digits than its factorization.
1023323013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23428 (or 23425 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
The square root of 1023323013 is about 31989.4203292276. The cubic root of 1023323013 is about 1007.7146685075.
Adding to 1023323013 its reverse (3103233201), we get a palindrome (4126556214).
The spelling of 1023323013 in words is "one billion, twenty-three million, three hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •