Base | Representation |
---|---|
bin | 100110110111010… |
… | …0100011001010111 |
3 | 10100212210202212200 |
4 | 1031232210121113 |
5 | 10132314201320 |
6 | 333222215543 |
7 | 44213161524 |
oct | 11556443127 |
9 | 3325722780 |
10 | 1304053335 |
11 | 60a116632 |
12 | 3048845b3 |
13 | 17a226bc0 |
14 | c529814b |
15 | 79741290 |
hex | 4dba4657 |
1304053335 has 48 divisors (see below), whose sum is σ = 2455899264. Its totient is φ = 636281856.
The previous prime is 1304053313. The next prime is 1304053351. The reversal of 1304053335 is 5333504031.
It is a happy number.
It is not a de Polignac number, because 1304053335 - 29 = 1304052823 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1304053299 and 1304053308.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 56242 + ... + 75968.
It is an arithmetic number, because the mean of its divisors is an integer number (51164568).
Almost surely, 21304053335 is an apocalyptic number.
1304053335 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1304053335 is a deficient number, since it is larger than the sum of its proper divisors (1151845929).
1304053335 is a wasteful number, since it uses less digits than its factorization.
1304053335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19864 (or 19861 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 27.
The square root of 1304053335 is about 36111.6786510957. The cubic root of 1304053335 is about 1092.5260090124.
Adding to 1304053335 its reverse (5333504031), we get a palindrome (6637557366).
The spelling of 1304053335 in words is "one billion, three hundred four million, fifty-three thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •