Base | Representation |
---|---|
bin | 11111110101010100111000… |
… | …101100111010001001100001 |
3 | 200100201020210111102000012021 |
4 | 133311110320230322021201 |
5 | 121322311143030304241 |
6 | 1213432541054101441 |
7 | 41326645432561003 |
oct | 3765247054721141 |
9 | 610636714360167 |
10 | 140004000244321 |
11 | 406783aa271a94 |
12 | 138518684aa881 |
13 | 60174223b9385 |
14 | 26803306a6373 |
15 | 112bc5a7ae0d1 |
hex | 7f5538b3a261 |
140004000244321 has 2 divisors, whose sum is σ = 140004000244322. Its totient is φ = 140004000244320.
The previous prime is 140004000244309. The next prime is 140004000244337. The reversal of 140004000244321 is 123442000400041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119509411105296 + 20494589139025 = 10932036^2 + 4527095^2 .
It is a cyclic number.
It is not a de Polignac number, because 140004000244321 - 217 = 140004000113249 is a prime.
It is a super-2 number, since 2×1400040002443212 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (140004000244391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70002000122160 + 70002000122161.
It is an arithmetic number, because the mean of its divisors is an integer number (70002000122161).
Almost surely, 2140004000244321 is an apocalyptic number.
It is an amenable number.
140004000244321 is a deficient number, since it is larger than the sum of its proper divisors (1).
140004000244321 is an equidigital number, since it uses as much as digits as its factorization.
140004000244321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 140004000244321 its reverse (123442000400041), we get a palindrome (263446000644362).
The spelling of 140004000244321 in words is "one hundred forty trillion, four billion, two hundred forty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •