Base | Representation |
---|---|
bin | 1000011110100010011000… |
… | …11101111001100011010011 |
3 | 2110000002211001222011020022 |
4 | 10033101030131321203103 |
5 | 4420410132342032323 |
6 | 103351432035134055 |
7 | 3632541166556066 |
oct | 417211435714323 |
9 | 73002731864208 |
10 | 18641440970963 |
11 | 5a378774a0688 |
12 | 2110a04a4432b |
13 | a52b5a154675 |
14 | 4863717588dd |
15 | 224d8ee974c8 |
hex | 10f44c7798d3 |
18641440970963 has 8 divisors (see below), whose sum is σ = 18773484320400. Its totient is φ = 18509490061920.
The previous prime is 18641440970941. The next prime is 18641440971001. The reversal of 18641440970963 is 36907904414681.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 18641440970963 - 216 = 18641440905427 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 18641440970896 and 18641440970905.
It is not an unprimeable number, because it can be changed into a prime (18641440970923) 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 in 7 ways as a sum of consecutive naturals, for example, 22705328 + ... + 23512013.
It is an arithmetic number, because the mean of its divisors is an integer number (2346685540050).
Almost surely, 218641440970963 is an apocalyptic number.
18641440970963 is a deficient number, since it is larger than the sum of its proper divisors (132043349437).
18641440970963 is a wasteful number, since it uses less digits than its factorization.
18641440970963 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46220197.
The product of its (nonzero) digits is 31352832, while the sum is 62.
The spelling of 18641440970963 in words is "eighteen trillion, six hundred forty-one billion, four hundred forty million, nine hundred seventy thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •