Base | Representation |
---|---|
bin | 10100010011010000011011… |
… | …10010100110001100100001 |
3 | 12212001202010012101201200021 |
4 | 22021220031302212030201 |
5 | 21322404031042121311 |
6 | 234540150225153441 |
7 | 12255200246206042 |
oct | 1211501562461441 |
9 | 185052105351607 |
10 | 44642121442081 |
11 | 13251687811099 |
12 | 500bb3818b881 |
13 | 1bba97075a707 |
14 | b04993cd88c9 |
15 | 52639d8cc171 |
hex | 289a0dca6321 |
44642121442081 has 2 divisors, whose sum is σ = 44642121442082. Its totient is φ = 44642121442080.
The previous prime is 44642121442063. The next prime is 44642121442151. The reversal of 44642121442081 is 18024412124644.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39176270219025 + 5465851223056 = 6259095^2 + 2337916^2 .
It is a cyclic number.
It is not a de Polignac number, because 44642121442081 - 227 = 44641987224353 is a prime.
It is a super-2 number, since 2×446421214420812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (44642121443081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22321060721040 + 22321060721041.
It is an arithmetic number, because the mean of its divisors is an integer number (22321060721041).
Almost surely, 244642121442081 is an apocalyptic number.
It is an amenable number.
44642121442081 is a deficient number, since it is larger than the sum of its proper divisors (1).
44642121442081 is an equidigital number, since it uses as much as digits as its factorization.
44642121442081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 393216, while the sum is 43.
The spelling of 44642121442081 in words is "forty-four trillion, six hundred forty-two billion, one hundred twenty-one million, four hundred forty-two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •