Base | Representation |
---|---|
bin | 111001011010010111… |
… | …000010010000010101 |
3 | 12220010011221101201201 |
4 | 321122113002100111 |
5 | 2002222223431013 |
6 | 44153005352501 |
7 | 4311430234435 |
oct | 713227022025 |
9 | 186104841651 |
10 | 61645530133 |
11 | 24164327220 |
12 | bb44b68731 |
13 | 5a75644965 |
14 | 2dab23a2c5 |
15 | 190be473dd |
hex | e5a5c2415 |
61645530133 has 8 divisors (see below), whose sum is σ = 69067228320. Its totient is φ = 54526758480.
The previous prime is 61645530131. The next prime is 61645530157. The reversal of 61645530133 is 33103554616.
It is a happy number.
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 61645530133 - 21 = 61645530131 is a prime.
It is a super-2 number, since 2×616455301332 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 61645530092 and 61645530101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61645530131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75731203 + ... + 75732016.
It is an arithmetic number, because the mean of its divisors is an integer number (8633403540).
Almost surely, 261645530133 is an apocalyptic number.
It is an amenable number.
61645530133 is a deficient number, since it is larger than the sum of its proper divisors (7421698187).
61645530133 is a wasteful number, since it uses less digits than its factorization.
61645530133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151463267.
The product of its (nonzero) digits is 97200, while the sum is 37.
The spelling of 61645530133 in words is "sixty-one billion, six hundred forty-five million, five hundred thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •