Base | Representation |
---|---|
bin | 1001111000101110111110… |
… | …00100100011111101000011 |
3 | 2211222101012211202110221212 |
4 | 10330113133010203331003 |
5 | 10322144142413000232 |
6 | 114123251512440335 |
7 | 4402463432635634 |
oct | 474273704437503 |
9 | 84871184673855 |
10 | 21740572000067 |
11 | 6a22141133798 |
12 | 25315756a90ab |
13 | c19186442b2b |
14 | 55236c11188b |
15 | 27a7c74c7eb2 |
hex | 13c5df123f43 |
21740572000067 has 4 divisors (see below), whose sum is σ = 21793727433240. Its totient is φ = 21687416566896.
The previous prime is 21740572000057. The next prime is 21740572000087. The reversal of 21740572000067 is 76000027504712.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21740572000067 - 210 = 21740571999043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21740571999988 and 21740572000033.
It is not an unprimeable number, because it can be changed into a prime (21740572000057) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26577715973 + ... + 26577716790.
It is an arithmetic number, because the mean of its divisors is an integer number (5448431858310).
Almost surely, 221740572000067 is an apocalyptic number.
21740572000067 is a deficient number, since it is larger than the sum of its proper divisors (53155433173).
21740572000067 is an equidigital number, since it uses as much as digits as its factorization.
21740572000067 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53155433172.
The product of its (nonzero) digits is 164640, while the sum is 41.
Adding to 21740572000067 its reverse (76000027504712), we get a palindrome (97740599504779).
The spelling of 21740572000067 in words is "twenty-one trillion, seven hundred forty billion, five hundred seventy-two million, sixty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •