Base | Representation |
---|---|
bin | 100110110100000… |
… | …0000101010100001 |
3 | 10100202120102112210 |
4 | 1031220000222201 |
5 | 10131344142423 |
6 | 333121312333 |
7 | 44162441313 |
oct | 11550005241 |
9 | 3322512483 |
10 | 1302334113 |
11 | 609151993 |
12 | 3041956a9 |
13 | 179a74502 |
14 | c4d6b7b3 |
15 | 79501b93 |
hex | 4da00aa1 |
1302334113 has 8 divisors (see below), whose sum is σ = 1838589408. Its totient is φ = 817150784.
The previous prime is 1302334109. The next prime is 1302334133. The reversal of 1302334113 is 3114332031.
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 1302334113 - 22 = 1302334109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1302334113.
It is not an unprimeable number, because it can be changed into a prime (1302334133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12767931 + ... + 12768032.
It is an arithmetic number, because the mean of its divisors is an integer number (229823676).
Almost surely, 21302334113 is an apocalyptic number.
It is an amenable number.
1302334113 is a deficient number, since it is larger than the sum of its proper divisors (536255295).
1302334113 is a wasteful number, since it uses less digits than its factorization.
1302334113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25535983.
The product of its (nonzero) digits is 648, while the sum is 21.
The square root of 1302334113 is about 36087.8665620455. The cubic root of 1302334113 is about 1092.0456808099.
Adding to 1302334113 its reverse (3114332031), we get a palindrome (4416666144).
The spelling of 1302334113 in words is "one billion, three hundred two million, three hundred thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •