Base | Representation |
---|---|
bin | 110111100101001000101000… |
… | …111010001000101010001001 |
3 | 1012001111122212100202210020212 |
4 | 313211020220322020222021 |
5 | 224014434220440404001 |
6 | 2223520122105130505 |
7 | 102326346320561405 |
oct | 6745105072105211 |
9 | 1161448770683225 |
10 | 244444455013001 |
11 | 70984347223651 |
12 | 234bab81489a35 |
13 | a652022cc7a09 |
14 | 4451263728105 |
15 | 1d3d8642ea7bb |
hex | de5228e88a89 |
244444455013001 has 2 divisors, whose sum is σ = 244444455013002. Its totient is φ = 244444455013000.
The previous prime is 244444455012973. The next prime is 244444455013007. The reversal of 244444455013001 is 100310554444442.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 243937511013001 + 506944000000 = 15618499^2 + 712000^2 .
It is a cyclic number.
It is not a de Polignac number, because 244444455013001 - 226 = 244444387904137 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 244444455013001.
It is not a weakly prime, because it can be changed into another prime (244444455013007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122222227506500 + 122222227506501.
It is an arithmetic number, because the mean of its divisors is an integer number (122222227506501).
Almost surely, 2244444455013001 is an apocalyptic number.
It is an amenable number.
244444455013001 is a deficient number, since it is larger than the sum of its proper divisors (1).
244444455013001 is an equidigital number, since it uses as much as digits as its factorization.
244444455013001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 614400, while the sum is 41.
The spelling of 244444455013001 in words is "two hundred forty-four trillion, four hundred forty-four billion, four hundred fifty-five million, thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •