Base | Representation |
---|---|
bin | 100111101001011… |
… | …0011101000001001 |
3 | 10102201020202211222 |
4 | 1033102303220021 |
5 | 10211031030441 |
6 | 340001331425 |
7 | 44652422321 |
oct | 11722635011 |
9 | 3381222758 |
10 | 1330330121 |
11 | 622a3378a |
12 | 311636b75 |
13 | 1827c72b3 |
14 | c8978281 |
15 | 7bbd1d4b |
hex | 4f4b3a09 |
1330330121 has 8 divisors (see below), whose sum is σ = 1409368320. Its totient is φ = 1251379008.
The previous prime is 1330330103. The next prime is 1330330123. The reversal of 1330330121 is 1210330331.
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 1330330121 - 214 = 1330313737 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1330330121.
It is not an unprimeable number, because it can be changed into a prime (1330330123) 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, 11120 + ... + 52766.
It is an arithmetic number, because the mean of its divisors is an integer number (176171040).
Almost surely, 21330330121 is an apocalyptic number.
It is an amenable number.
1330330121 is a deficient number, since it is larger than the sum of its proper divisors (79038199).
1330330121 is a wasteful number, since it uses less digits than its factorization.
1330330121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43543.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 1330330121 is about 36473.6908058398. The cubic root of 1330330121 is about 1099.8154293629.
Adding to 1330330121 its reverse (1210330331), we get a palindrome (2540660452).
The spelling of 1330330121 in words is "one billion, three hundred thirty million, three hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •