Base | Representation |
---|---|
bin | 11100001001110101010111… |
… | …10001010110010101111001 |
3 | 22010012120221000022010001021 |
4 | 32010322223301112111321 |
5 | 31103320241323220144 |
6 | 335401150514422441 |
7 | 16016613622654462 |
oct | 1604725361262571 |
9 | 263176830263037 |
10 | 61910540445049 |
11 | 187aa1270931aa |
12 | 6b3a816891a21 |
13 | 28711a626695a |
14 | 11406b3dabd69 |
15 | 72567ddaa884 |
hex | 384eabc56579 |
61910540445049 has 2 divisors, whose sum is σ = 61910540445050. Its totient is φ = 61910540445048.
The previous prime is 61910540445043. The next prime is 61910540445077. The reversal of 61910540445049 is 94054404501916.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 44972541708649 + 16937998736400 = 6706157^2 + 4115580^2 .
It is a cyclic number.
It is not a de Polignac number, because 61910540445049 - 23 = 61910540445041 is a prime.
It is a super-2 number, since 2×619105404450492 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 61910540444987 and 61910540445005.
It is not a weakly prime, because it can be changed into another prime (61910540445041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30955270222524 + 30955270222525.
It is an arithmetic number, because the mean of its divisors is an integer number (30955270222525).
Almost surely, 261910540445049 is an apocalyptic number.
It is an amenable number.
61910540445049 is a deficient number, since it is larger than the sum of its proper divisors (1).
61910540445049 is an equidigital number, since it uses as much as digits as its factorization.
61910540445049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3110400, while the sum is 52.
The spelling of 61910540445049 in words is "sixty-one trillion, nine hundred ten billion, five hundred forty million, four hundred forty-five thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •