Base | Representation |
---|---|
bin | 11011110000010001110000… |
… | …11101011000011011001011 |
3 | 22000002122101011021202220122 |
4 | 31320020320131120123023 |
5 | 30444423410210034400 |
6 | 333445525030013455 |
7 | 15566306400420320 |
oct | 1570107035303313 |
9 | 260078334252818 |
10 | 61032432502475 |
11 | 184a0789043155 |
12 | 6a185b21a728b |
13 | 2809445167aa5 |
14 | 110ddb22a8b47 |
15 | 70c8d8789685 |
hex | 3782387586cb |
61032432502475 has 24 divisors (see below), whose sum is σ = 86491995372288. Its totient is φ = 41850656215200.
The previous prime is 61032432502451. The next prime is 61032432502487. The reversal of 61032432502475 is 57420523423016.
61032432502475 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 61032432502475 - 26 = 61032432502411 is a prime.
It is a super-2 number, since 2×610324325024752 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 67205882 + ... + 68107968.
It is an arithmetic number, because the mean of its divisors is an integer number (3603833140512).
Almost surely, 261032432502475 is an apocalyptic number.
61032432502475 is a deficient number, since it is larger than the sum of its proper divisors (25459562869813).
61032432502475 is a wasteful number, since it uses less digits than its factorization.
61032432502475 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1288715 (or 1288710 counting only the distinct ones).
The product of its (nonzero) digits is 1209600, while the sum is 44.
The spelling of 61032432502475 in words is "sixty-one trillion, thirty-two billion, four hundred thirty-two million, five hundred two thousand, four hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •