Base | Representation |
---|---|
bin | 111100011000110… |
… | …010101100111101 |
3 | 2121121101102221212 |
4 | 330120302230331 |
5 | 4033330211333 |
6 | 244310534205 |
7 | 34051323611 |
oct | 7430625475 |
9 | 2547342855 |
10 | 1013132093 |
11 | 47a983156 |
12 | 243367365 |
13 | 131b8755c |
14 | 987a9341 |
15 | 5de27448 |
hex | 3c632b3d |
1013132093 has 2 divisors, whose sum is σ = 1013132094. Its totient is φ = 1013132092.
The previous prime is 1013132089. The next prime is 1013132143. The reversal of 1013132093 is 3902313101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 778521604 + 234610489 = 27902^2 + 15317^2 .
It is a cyclic number.
It is not a de Polignac number, because 1013132093 - 22 = 1013132089 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1013132693) 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 as a sum of consecutive naturals, namely, 506566046 + 506566047.
It is an arithmetic number, because the mean of its divisors is an integer number (506566047).
Almost surely, 21013132093 is an apocalyptic number.
It is an amenable number.
1013132093 is a deficient number, since it is larger than the sum of its proper divisors (1).
1013132093 is an equidigital number, since it uses as much as digits as its factorization.
1013132093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
The square root of 1013132093 is about 31829.7359869667. The cubic root of 1013132093 is about 1004.3583415961.
Adding to 1013132093 its reverse (3902313101), we get a palindrome (4915445194).
It can be divided in two parts, 10131 and 32093, that added together give a palindrome (42224).
The spelling of 1013132093 in words is "one billion, thirteen million, one hundred thirty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •