Base | Representation |
---|---|
bin | 1001001110011110110110… |
… | …0111110001001011111011 |
3 | 1022220210110222121101210202 |
4 | 2103213231213301023323 |
5 | 2312201220012124011 |
6 | 33324135224432415 |
7 | 2064623540523344 |
oct | 223475547611373 |
9 | 38823428541722 |
10 | 10144404411131 |
11 | 326124390a461 |
12 | 117a07861870b |
13 | 5877c8366243 |
14 | 270dc56a30cb |
15 | 128d2c67023b |
hex | 939ed9f12fb |
10144404411131 has 16 divisors (see below), whose sum is σ = 10766546396928. Its totient is φ = 9525088512000.
The previous prime is 10144404411121. The next prime is 10144404411137. The reversal of 10144404411131 is 13111440444101.
It is a cyclic number.
It is not a de Polignac number, because 10144404411131 - 222 = 10144400216827 is a prime.
It is a super-2 number, since 2×101444044111312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10144404411094 and 10144404411103.
It is not an unprimeable number, because it can be changed into a prime (10144404411137) 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, 202777901 + ... + 202827921.
It is an arithmetic number, because the mean of its divisors is an integer number (672909149808).
Almost surely, 210144404411131 is an apocalyptic number.
10144404411131 is a deficient number, since it is larger than the sum of its proper divisors (622141985797).
10144404411131 is a wasteful number, since it uses less digits than its factorization.
10144404411131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78022.
The product of its (nonzero) digits is 3072, while the sum is 29.
Adding to 10144404411131 its reverse (13111440444101), we get a palindrome (23255844855232).
The spelling of 10144404411131 in words is "ten trillion, one hundred forty-four billion, four hundred four million, four hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •