Base | Representation |
---|---|
bin | 111100011000110… |
… | …011000000001011 |
3 | 2121121101111122102 |
4 | 330120303000023 |
5 | 4033330231243 |
6 | 244310544015 |
7 | 34051330316 |
oct | 7430630013 |
9 | 2547344572 |
10 | 1013133323 |
11 | 47a984074 |
12 | 24336800b |
13 | 131b87c97 |
14 | 987a997d |
15 | 5de279b8 |
hex | 3c63300b |
1013133323 has 8 divisors (see below), whose sum is σ = 1039943856. Its totient is φ = 986652000.
The previous prime is 1013133313. The next prime is 1013133337. The reversal of 1013133323 is 3233313101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1013133323 - 24 = 1013133307 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1013133295 and 1013133304.
It is not an unprimeable number, because it can be changed into a prime (1013133313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76061 + ... + 88382.
It is an arithmetic number, because the mean of its divisors is an integer number (129992982).
Almost surely, 21013133323 is an apocalyptic number.
1013133323 is a deficient number, since it is larger than the sum of its proper divisors (26810533).
1013133323 is a wasteful number, since it uses less digits than its factorization.
1013133323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164605.
The product of its (nonzero) digits is 486, while the sum is 20.
The square root of 1013133323 is about 31829.7553085160. The cubic root of 1013133323 is about 1004.3587480453.
Adding to 1013133323 its reverse (3233313101), we get a palindrome (4246446424).
The spelling of 1013133323 in words is "one billion, thirteen million, one hundred thirty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •