Base | Representation |
---|---|
bin | 100110110111100… |
… | …1000100001110010 |
3 | 10100220002021212222 |
4 | 1031233020201302 |
5 | 10132333420310 |
6 | 333225321042 |
7 | 44214346145 |
oct | 11557104162 |
9 | 3326067788 |
10 | 1304201330 |
11 | 60a207843 |
12 | 304936182 |
13 | 17a279383 |
14 | c52d605c |
15 | 79770055 |
hex | 4dbc8872 |
1304201330 has 8 divisors (see below), whose sum is σ = 2347562412. Its totient is φ = 521680528.
The previous prime is 1304201317. The next prime is 1304201333. The reversal of 1304201330 is 331024031.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1108956601 + 195244729 = 33301^2 + 13973^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×13042013302 = 3401882218347537800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1304201299 and 1304201308.
It is not an unprimeable number, because it can be changed into a prime (1304201333) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 65210057 + ... + 65210076.
Almost surely, 21304201330 is an apocalyptic number.
1304201330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1304201330 is a deficient number, since it is larger than the sum of its proper divisors (1043361082).
1304201330 is a wasteful number, since it uses less digits than its factorization.
1304201330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130420140.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 1304201330 is about 36113.7277222942. The cubic root of 1304201330 is about 1092.5673371458.
Adding to 1304201330 its reverse (331024031), we get a palindrome (1635225361).
The spelling of 1304201330 in words is "one billion, three hundred four million, two hundred one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •