Base | Representation |
---|---|
bin | 1001000111010110110111… |
… | …00001110000110110010101 |
3 | 2121222012001212002200110211 |
4 | 10203223123201300312111 |
5 | 10111400103104324102 |
6 | 110344030420445421 |
7 | 4136063005551556 |
oct | 443533341606625 |
9 | 77865055080424 |
10 | 20044000464277 |
11 | 64286817970a9 |
12 | 22b87b3249871 |
13 | b251ab0bb10a |
14 | 4d41c5c6032d |
15 | 24b5ccb857d7 |
hex | 123adb870d95 |
20044000464277 has 2 divisors, whose sum is σ = 20044000464278. Its totient is φ = 20044000464276.
The previous prime is 20044000464239. The next prime is 20044000464377. The reversal of 20044000464277 is 77246400044002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15202442738961 + 4841557725316 = 3899031^2 + 2200354^2 .
It is a cyclic number.
It is not a de Polignac number, because 20044000464277 - 215 = 20044000431509 is a prime.
It is a super-2 number, since 2×200440004642772 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20044000464377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10022000232138 + 10022000232139.
It is an arithmetic number, because the mean of its divisors is an integer number (10022000232139).
Almost surely, 220044000464277 is an apocalyptic number.
It is an amenable number.
20044000464277 is a deficient number, since it is larger than the sum of its proper divisors (1).
20044000464277 is an equidigital number, since it uses as much as digits as its factorization.
20044000464277 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 301056, while the sum is 40.
The spelling of 20044000464277 in words is "twenty trillion, forty-four billion, four hundred sixty-four thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •