Base | Representation |
---|---|
bin | 110100101100011011111… |
… | …000011011000001110101 |
3 | 110211011202102220222211022 |
4 | 310230123320123001311 |
5 | 433312031023044013 |
6 | 11411304424150525 |
7 | 522421600253261 |
oct | 64543370330165 |
9 | 13734672828738 |
10 | 3621125206133 |
11 | 117678a85a316 |
12 | 4a596b608445 |
13 | 203616ccc986 |
14 | c7398a830a1 |
15 | 642d8ee2008 |
hex | 34b1be1b075 |
3621125206133 has 2 divisors, whose sum is σ = 3621125206134. Its totient is φ = 3621125206132.
The previous prime is 3621125206091. The next prime is 3621125206147. The reversal of 3621125206133 is 3316025211263.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2825065108849 + 796060097284 = 1680793^2 + 892222^2 .
It is a cyclic number.
It is not a de Polignac number, because 3621125206133 - 28 = 3621125205877 is a prime.
It is a super-2 number, since 2×36211252061332 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3621125206093 and 3621125206102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3621125236133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1810562603066 + 1810562603067.
It is an arithmetic number, because the mean of its divisors is an integer number (1810562603067).
Almost surely, 23621125206133 is an apocalyptic number.
It is an amenable number.
3621125206133 is a deficient number, since it is larger than the sum of its proper divisors (1).
3621125206133 is an equidigital number, since it uses as much as digits as its factorization.
3621125206133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38880, while the sum is 35.
The spelling of 3621125206133 in words is "three trillion, six hundred twenty-one billion, one hundred twenty-five million, two hundred six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •