Base | Representation |
---|---|
bin | 11011111100001100110111… |
… | …00001001111100111000111 |
3 | 22001112210211201201200201211 |
4 | 31332012123201033213013 |
5 | 31023131423241234310 |
6 | 334402041340432251 |
7 | 15641021630611156 |
oct | 1576063341174707 |
9 | 261483751650654 |
10 | 61442116352455 |
11 | 18639500985353 |
12 | 6a83a88548687 |
13 | 2838c74b2c877 |
14 | 1125b5861559d |
15 | 7183b53e1c8a |
hex | 37e19b84f9c7 |
61442116352455 has 8 divisors (see below), whose sum is σ = 76108944127104. Its totient is φ = 47568090079200.
The previous prime is 61442116352437. The next prime is 61442116352459. The reversal of 61442116352455 is 55425361124416.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 61442116352455 - 213 = 61442116344263 is a prime.
It is a super-2 number, since 2×614421163524552 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 61442116352399 and 61442116352408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61442116352459) 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, 198200375176 + ... + 198200375485.
It is an arithmetic number, because the mean of its divisors is an integer number (9513618015888).
Almost surely, 261442116352455 is an apocalyptic number.
61442116352455 is a deficient number, since it is larger than the sum of its proper divisors (14666827774649).
61442116352455 is a wasteful number, since it uses less digits than its factorization.
61442116352455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396400750697.
The product of its digits is 3456000, while the sum is 49.
The spelling of 61442116352455 in words is "sixty-one trillion, four hundred forty-two billion, one hundred sixteen million, three hundred fifty-two thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •