Base | Representation |
---|---|
bin | 100111101000110… |
… | …0011000010010111 |
3 | 10102200122000001010 |
4 | 1033101203002113 |
5 | 10210440000043 |
6 | 335550303303 |
7 | 44646546042 |
oct | 11721430227 |
9 | 3380560033 |
10 | 1330000023 |
11 | 622828780 |
12 | 3114b7b33 |
13 | 18270cc81 |
14 | c88cdc59 |
15 | 7bb69133 |
hex | 4f463097 |
1330000023 has 8 divisors (see below), whose sum is σ = 1934545536. Its totient is φ = 806060600.
The previous prime is 1330000013. The next prime is 1330000043. The reversal of 1330000023 is 3200000331.
It is a happy number.
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 1330000023 - 26 = 1329999959 is a prime.
It is a super-2 number, since 2×13300000232 = 3537800122360001058, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1329999963 and 1330000008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1330000013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20151483 + ... + 20151548.
It is an arithmetic number, because the mean of its divisors is an integer number (241818192).
Almost surely, 21330000023 is an apocalyptic number.
1330000023 is a deficient number, since it is larger than the sum of its proper divisors (604545513).
1330000023 is a wasteful number, since it uses less digits than its factorization.
1330000023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40303045.
The product of its (nonzero) digits is 54, while the sum is 12.
The square root of 1330000023 is about 36469.1653729558. The cubic root of 1330000023 is about 1099.7244552255.
Adding to 1330000023 its reverse (3200000331), we get a palindrome (4530000354).
The spelling of 1330000023 in words is "one billion, three hundred thirty million, twenty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •