Base | Representation |
---|---|
bin | 110000011100111100… |
… | …0000110000101101101 |
3 | 100221120102211220112111 |
4 | 1200321320012011231 |
5 | 3201043324041141 |
6 | 115444445204021 |
7 | 10342314201136 |
oct | 1407170060555 |
9 | 327512756474 |
10 | 104050221421 |
11 | 40144701433 |
12 | 181ba260611 |
13 | 9a72966273 |
14 | 5070d28c8d |
15 | 2a8ead0381 |
hex | 1839e0616d |
104050221421 has 8 divisors (see below), whose sum is σ = 104331052800. Its totient is φ = 103769459280.
The previous prime is 104050221397. The next prime is 104050221449. The reversal of 104050221421 is 124122050401.
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 104050221421 - 27 = 104050221293 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104050221392 and 104050221401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104050221481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4684540 + ... + 4706698.
It is an arithmetic number, because the mean of its divisors is an integer number (13041381600).
Almost surely, 2104050221421 is an apocalyptic number.
It is an amenable number.
104050221421 is a deficient number, since it is larger than the sum of its proper divisors (280831379).
104050221421 is a wasteful number, since it uses less digits than its factorization.
104050221421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34619.
The product of its (nonzero) digits is 640, while the sum is 22.
Adding to 104050221421 its reverse (124122050401), we get a palindrome (228172271822).
The spelling of 104050221421 in words is "one hundred four billion, fifty million, two hundred twenty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.333 sec. • engine limits •