Base | Representation |
---|---|
bin | 10100001110100110010001… |
… | …10101000010111100011101 |
3 | 12211111102221120222210111222 |
4 | 22013103020311002330131 |
5 | 21312243214432310034 |
6 | 234334434425023125 |
7 | 12240502453105256 |
oct | 1207231065027435 |
9 | 184442846883458 |
10 | 44482050666269 |
11 | 1319a805a58027 |
12 | 4ba4b04924aa5 |
13 | 1ba8840940118 |
14 | adad2ac3db2d |
15 | 522130b0e12e |
hex | 2874c8d42f1d |
44482050666269 has 2 divisors, whose sum is σ = 44482050666270. Its totient is φ = 44482050666268.
The previous prime is 44482050666197. The next prime is 44482050666311. The reversal of 44482050666269 is 96266605028444.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32220813090244 + 12261237576025 = 5676338^2 + 3501605^2 .
It is a cyclic number.
It is not a de Polignac number, because 44482050666269 - 216 = 44482050600733 is a prime.
It is a super-2 number, since 2×444820506662692 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (44482050660269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 22241025333134 + 22241025333135.
It is an arithmetic number, because the mean of its divisors is an integer number (22241025333135).
Almost surely, 244482050666269 is an apocalyptic number.
It is an amenable number.
44482050666269 is a deficient number, since it is larger than the sum of its proper divisors (1).
44482050666269 is an equidigital number, since it uses as much as digits as its factorization.
44482050666269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 119439360, while the sum is 62.
The spelling of 44482050666269 in words is "forty-four trillion, four hundred eighty-two billion, fifty million, six hundred sixty-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •