Base | Representation |
---|---|
bin | 1001011000001101000110… |
… | …1110111001001010111101 |
3 | 1100111202121222222202101202 |
4 | 2112003101232321022331 |
5 | 2322420312200210331 |
6 | 33533002114145245 |
7 | 2112656046616151 |
oct | 226032156711275 |
9 | 40452558882352 |
10 | 10311440241341 |
11 | 331606a219a28 |
12 | 11a6514582225 |
13 | 59a4981726b5 |
14 | 27910d7bd061 |
15 | 12d356b52ecb |
hex | 960d1bb92bd |
10311440241341 has 16 divisors (see below), whose sum is σ = 10468034740800. Its totient is φ = 10156276651008.
The previous prime is 10311440241269. The next prime is 10311440241359. The reversal of 10311440241341 is 14314204411301.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10311440241341 - 210 = 10311440240317 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10311440244341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10770845 + ... + 11689053.
It is an arithmetic number, because the mean of its divisors is an integer number (654252171300).
Almost surely, 210311440241341 is an apocalyptic number.
It is an amenable number.
10311440241341 is a deficient number, since it is larger than the sum of its proper divisors (156594499459).
10311440241341 is a wasteful number, since it uses less digits than its factorization.
10311440241341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 918988.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 10311440241341 its reverse (14314204411301), we get a palindrome (24625644652642).
The spelling of 10311440241341 in words is "ten trillion, three hundred eleven billion, four hundred forty million, two hundred forty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •