Base | Representation |
---|---|
bin | 10111101111110111010000… |
… | …110101111000111010101001 |
3 | 111200210202210111221102011021 |
4 | 113233313100311320322221 |
5 | 102142203232210241041 |
6 | 1010045003000332441 |
7 | 30666563136616636 |
oct | 2757672065707251 |
9 | 450722714842137 |
10 | 104444223524521 |
11 | 30308601362711 |
12 | b869ba7174121 |
13 | 46380816566aa |
14 | 1bb11ad7bd18d |
15 | c11c79834cd1 |
hex | 5efdd0d78ea9 |
104444223524521 has 16 divisors (see below), whose sum is σ = 108841334210560. Its totient is φ = 100113981564240.
The previous prime is 104444223524507. The next prime is 104444223524549. The reversal of 104444223524521 is 125425322444401.
It is a cyclic number.
It is not a de Polignac number, because 104444223524521 - 213 = 104444223516329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104444223524561) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19462701 + ... + 24242218.
It is an arithmetic number, because the mean of its divisors is an integer number (6802583388160).
Almost surely, 2104444223524521 is an apocalyptic number.
It is an amenable number.
104444223524521 is a deficient number, since it is larger than the sum of its proper divisors (4397110686039).
104444223524521 is a wasteful number, since it uses less digits than its factorization.
104444223524521 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43705684.
The product of its (nonzero) digits is 1228800, while the sum is 43.
Adding to 104444223524521 its reverse (125425322444401), we get a palindrome (229869545968922).
The spelling of 104444223524521 in words is "one hundred four trillion, four hundred forty-four billion, two hundred twenty-three million, five hundred twenty-four thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •