Base | Representation |
---|---|
bin | 100111101001010… |
… | …1101101111111001 |
3 | 10102201012112211010 |
4 | 1033102231233321 |
5 | 10211024243131 |
6 | 340001024133 |
7 | 44652262161 |
oct | 11722555771 |
9 | 3381175733 |
10 | 1330306041 |
11 | 622a17689 |
12 | 311625049 |
13 | 1827b934c |
14 | c896d5a1 |
15 | 7bbc9b46 |
hex | 4f4adbf9 |
1330306041 has 8 divisors (see below), whose sum is σ = 1774007424. Its totient is φ = 886737680.
The previous prime is 1330305997. The next prime is 1330306057. The reversal of 1330306041 is 1406030331.
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 1330306041 - 214 = 1330289657 is a prime.
It is a super-3 number, since 3×13303060413 (a number of 28 digits) contains 333 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1330305999 and 1330306017.
It is not an unprimeable number, because it can be changed into a prime (1330306091) 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, 6945 + ... + 52046.
It is an arithmetic number, because the mean of its divisors is an integer number (221750928).
Almost surely, 21330306041 is an apocalyptic number.
It is an amenable number.
1330306041 is a deficient number, since it is larger than the sum of its proper divisors (443701383).
1330306041 is an equidigital number, since it uses as much as digits as its factorization.
1330306041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66511.
The product of its (nonzero) digits is 648, while the sum is 21.
The square root of 1330306041 is about 36473.3607033956. The cubic root of 1330306041 is about 1099.8087934874.
Adding to 1330306041 its reverse (1406030331), we get a palindrome (2736336372).
The spelling of 1330306041 in words is "one billion, three hundred thirty million, three hundred six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •