Base | Representation |
---|---|
bin | 100111101111000… |
… | …1001001101110010 |
3 | 10102220211202200101 |
4 | 1033132021031302 |
5 | 10212311132010 |
6 | 340145143014 |
7 | 45016611136 |
oct | 11736111562 |
9 | 3386752611 |
10 | 1333302130 |
11 | 624683696 |
12 | 31262aa6a |
13 | 1832c7c94 |
14 | c910d3c6 |
15 | 7c0bc73a |
hex | 4f789372 |
1333302130 has 32 divisors (see below), whose sum is σ = 2416677120. Its totient is φ = 529616640.
The previous prime is 1333302109. The next prime is 1333302137. The reversal of 1333302130 is 312033331.
It is a junction number, because it is equal to n+sod(n) for n = 1333302098 and 1333302107.
It is not an unprimeable number, because it can be changed into a prime (1333302137) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 1364202 + ... + 1365178.
It is an arithmetic number, because the mean of its divisors is an integer number (75521160).
Almost surely, 21333302130 is an apocalyptic number.
1333302130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1333302130 is a deficient number, since it is larger than the sum of its proper divisors (1083374990).
1333302130 is a wasteful number, since it uses less digits than its factorization.
1333302130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1794.
The product of its (nonzero) digits is 486, while the sum is 19.
The square root of 1333302130 is about 36514.4098952729. The cubic root of 1333302130 is about 1100.6338303032.
Adding to 1333302130 its reverse (312033331), we get a palindrome (1645335461).
It can be divided in two parts, 133330 and 2130, that added together give a triangular number (135460 = T520).
The spelling of 1333302130 in words is "one billion, three hundred thirty-three million, three hundred two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •