Base | Representation |
---|---|
bin | 111100111111101… |
… | …000000111000011 |
3 | 2122022112122121102 |
4 | 330333220013003 |
5 | 4043431443243 |
6 | 245313045015 |
7 | 34234003565 |
oct | 7477500703 |
9 | 2568478542 |
10 | 1023312323 |
11 | 4856a6770 |
12 | 24685676b |
13 | 134010167 |
14 | 99c99335 |
15 | 5ec889b8 |
hex | 3cfe81c3 |
1023312323 has 16 divisors (see below), whose sum is σ = 1145760000. Its totient is φ = 905899680.
The previous prime is 1023312319. The next prime is 1023312379. The reversal of 1023312323 is 3232133201.
It is a cyclic number.
It is not a de Polignac number, because 1023312323 - 22 = 1023312319 is a prime.
It is a super-2 number, since 2×10233123232 = 2094336220807312658, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1023312295 and 1023312304.
It is not an unprimeable number, because it can be changed into a prime (1023311323) 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 15 ways as a sum of consecutive naturals, for example, 161978 + ... + 168176.
It is an arithmetic number, because the mean of its divisors is an integer number (71610000).
Almost surely, 21023312323 is an apocalyptic number.
1023312323 is a deficient number, since it is larger than the sum of its proper divisors (122447677).
1023312323 is a wasteful number, since it uses less digits than its factorization.
1023312323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6602.
The product of its (nonzero) digits is 648, while the sum is 20.
The square root of 1023312323 is about 31989.2532423000. The cubic root of 1023312323 is about 1007.7111595120.
Adding to 1023312323 its reverse (3232133201), we get a palindrome (4255445524).
The spelling of 1023312323 in words is "one billion, twenty-three million, three hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •