Base | Representation |
---|---|
bin | 110100110100101111110… |
… | …110010001001101000001 |
3 | 110212000210102201121201202 |
4 | 310310233312101031001 |
5 | 433433320312324023 |
6 | 11415342204110545 |
7 | 523156011626645 |
oct | 64645766211501 |
9 | 13760712647652 |
10 | 3630050120513 |
11 | 117a54a726613 |
12 | 4a7640535455 |
13 | 20440a0506bb |
14 | c79a4110c25 |
15 | 6465c7db128 |
hex | 34d2fd91341 |
3630050120513 has 2 divisors, whose sum is σ = 3630050120514. Its totient is φ = 3630050120512.
The previous prime is 3630050120503. The next prime is 3630050120539. The reversal of 3630050120513 is 3150210500363.
3630050120513 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3566009238544 + 64040881969 = 1888388^2 + 253063^2 .
It is a cyclic number.
It is not a de Polignac number, because 3630050120513 - 226 = 3629983011649 is a prime.
It is not a weakly prime, because it can be changed into another prime (3630050120503) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1815025060256 + 1815025060257.
It is an arithmetic number, because the mean of its divisors is an integer number (1815025060257).
Almost surely, 23630050120513 is an apocalyptic number.
It is an amenable number.
3630050120513 is a deficient number, since it is larger than the sum of its proper divisors (1).
3630050120513 is an equidigital number, since it uses as much as digits as its factorization.
3630050120513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 29.
Adding to 3630050120513 its reverse (3150210500363), we get a palindrome (6780260620876).
The spelling of 3630050120513 in words is "three trillion, six hundred thirty billion, fifty million, one hundred twenty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •