Base | Representation |
---|---|
bin | 11011111011000010111110… |
… | …11010110100100010110100 |
3 | 22001102000110112202101122212 |
4 | 31331201133122310202310 |
5 | 31022004211023030400 |
6 | 334331521520312552 |
7 | 15635116014516401 |
oct | 1575413732644264 |
9 | 261360415671585 |
10 | 61402453330100 |
11 | 186236a8167633 |
12 | 6a78259472758 |
13 | 28352c382407c |
14 | 1123c74ac52a8 |
15 | 7173432c0335 |
hex | 37d85f6b48b4 |
61402453330100 has 36 divisors (see below), whose sum is σ = 137837921102700. Its totient is φ = 23714050940160.
The previous prime is 61402453330073. The next prime is 61402453330109. The reversal of 61402453330100 is 103335420416.
It can be written as a sum of positive squares in 6 ways, for example, as 118794651556 + 61283658678544 = 344666^2 + 7828388^2 .
It is a super-2 number, since 2×614024533301002 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61402453330109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10586626985 + ... + 10586632784.
Almost surely, 261402453330100 is an apocalyptic number.
It is an amenable number.
61402453330100 is an abundant number, since it is smaller than the sum of its proper divisors (76435467772600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61402453330100 is a wasteful number, since it uses less digits than its factorization.
61402453330100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21173259812 (or 21173259805 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 32.
Adding to 61402453330100 its reverse (103335420416), we get a palindrome (61505788750516).
The spelling of 61402453330100 in words is "sixty-one trillion, four hundred two billion, four hundred fifty-three million, three hundred thirty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •