Base | Representation |
---|---|
bin | 1001011111110001010111… |
… | …0110100110011100001101 |
3 | 1100222012011100122222012012 |
4 | 2113330111312212130031 |
5 | 2332033023111200331 |
6 | 34112421103351005 |
7 | 2125240264505201 |
oct | 227742566463415 |
9 | 40865140588165 |
10 | 10441432131341 |
11 | 3366206259982 |
12 | 12077525b2465 |
13 | 5a98134679c3 |
14 | 281521b76b01 |
15 | 131913e1382b |
hex | 97f15da670d |
10441432131341 has 16 divisors (see below), whose sum is σ = 10675440368640. Its totient is φ = 10210024384560.
The previous prime is 10441432131337. The next prime is 10441432131349. The reversal of 10441432131341 is 14313123414401.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10441432131341 - 22 = 10441432131337 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10441432131298 and 10441432131307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10441432131349) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30012710 + ... + 30358616.
It is an arithmetic number, because the mean of its divisors is an integer number (667215023040).
Almost surely, 210441432131341 is an apocalyptic number.
It is an amenable number.
10441432131341 is a deficient number, since it is larger than the sum of its proper divisors (234008237299).
10441432131341 is a wasteful number, since it uses less digits than its factorization.
10441432131341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349664.
The product of its (nonzero) digits is 13824, while the sum is 32.
Adding to 10441432131341 its reverse (14313123414401), we get a palindrome (24754555545742).
The spelling of 10441432131341 in words is "ten trillion, four hundred forty-one billion, four hundred thirty-two million, one hundred thirty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •