Base | Representation |
---|---|
bin | 110000111001111100… |
… | …0011111010110110001 |
3 | 101001002021001200022000 |
4 | 1201303320133112301 |
5 | 3210041442402231 |
6 | 120125212004213 |
7 | 10405402125405 |
oct | 1416370372661 |
9 | 331067050260 |
10 | 105023403441 |
11 | 405a3a784a0 |
12 | 18430160669 |
13 | 9b99473908 |
14 | 5124295105 |
15 | 2aea2656e6 |
hex | 1873e1f5b1 |
105023403441 has 64 divisors (see below), whose sum is σ = 171200839680. Its totient is φ = 63103104000.
The previous prime is 105023403427. The next prime is 105023403451. The reversal of 105023403441 is 144304320501.
It is a happy number.
It is not a de Polignac number, because 105023403441 - 25 = 105023403409 is a prime.
It is a super-2 number, since 2×1050234034412 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (105023403451) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 17639121 + ... + 17645073.
It is an arithmetic number, because the mean of its divisors is an integer number (2675013120).
Almost surely, 2105023403441 is an apocalyptic number.
105023403441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
105023403441 is a deficient number, since it is larger than the sum of its proper divisors (66177436239).
105023403441 is a wasteful number, since it uses less digits than its factorization.
105023403441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6475 (or 6469 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 105023403441 its reverse (144304320501), we get a palindrome (249327723942).
The spelling of 105023403441 in words is "one hundred five billion, twenty-three million, four hundred three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •