Base | Representation |
---|---|
bin | 1001100111100010111111… |
… | …00111000100110101000001 |
3 | 2202212220220110201020000021 |
4 | 10303301133213010311001 |
5 | 10233010221344410132 |
6 | 112552104135053441 |
7 | 4312016200431031 |
oct | 463613747046501 |
9 | 82786813636007 |
10 | 21150023044417 |
11 | 68147466a0753 |
12 | 2457023b11281 |
13 | ba5591839a77 |
14 | 5319491338c1 |
15 | 26a26222e997 |
hex | 133c5f9c4d41 |
21150023044417 has 8 divisors (see below), whose sum is σ = 21155792844672. Its totient is φ = 21144253556400.
The previous prime is 21150023044399. The next prime is 21150023044439. The reversal of 21150023044417 is 71444032005112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21150023044417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21150023044487) 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, 209063667 + ... + 209164807.
It is an arithmetic number, because the mean of its divisors is an integer number (2644474105584).
Almost surely, 221150023044417 is an apocalyptic number.
It is an amenable number.
21150023044417 is a deficient number, since it is larger than the sum of its proper divisors (5769800255).
21150023044417 is a wasteful number, since it uses less digits than its factorization.
21150023044417 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156119.
The product of its (nonzero) digits is 26880, while the sum is 34.
Adding to 21150023044417 its reverse (71444032005112), we get a palindrome (92594055049529).
The spelling of 21150023044417 in words is "twenty-one trillion, one hundred fifty billion, twenty-three million, forty-four thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •