Base | Representation |
---|---|
bin | 100000101000001110101… |
… | …1110000000111101011101 |
3 | 120212201010100111221210012 |
4 | 1001100131132000331131 |
5 | 1041433113201431131 |
6 | 13312042354053005 |
7 | 641663416213316 |
oct | 101203536007535 |
9 | 16781110457705 |
10 | 4484440264541 |
11 | 1479927690566 |
12 | 605145b7a165 |
13 | 266b5b45b943 |
14 | 117095c7760d |
15 | 7b9b5ab152b |
hex | 4141d780f5d |
4484440264541 has 2 divisors, whose sum is σ = 4484440264542. Its totient is φ = 4484440264540.
The previous prime is 4484440264531. The next prime is 4484440264649. The reversal of 4484440264541 is 1454620444844.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4344081388516 + 140358876025 = 2084246^2 + 374645^2 .
It is a cyclic number.
It is not a de Polignac number, because 4484440264541 - 218 = 4484440002397 is a prime.
It is a super-2 number, since 2×44844402645412 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4484440264541.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4484440264531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2242220132270 + 2242220132271.
It is an arithmetic number, because the mean of its divisors is an integer number (2242220132271).
Almost surely, 24484440264541 is an apocalyptic number.
It is an amenable number.
4484440264541 is a deficient number, since it is larger than the sum of its proper divisors (1).
4484440264541 is an equidigital number, since it uses as much as digits as its factorization.
4484440264541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7864320, while the sum is 50.
The spelling of 4484440264541 in words is "four trillion, four hundred eighty-four billion, four hundred forty million, two hundred sixty-four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •