Base | Representation |
---|---|
bin | 10111111100111101101000… |
… | …111011010101000100000111 |
3 | 111210222211100222112201022012 |
4 | 113330331220323111010013 |
5 | 102301430334323032411 |
6 | 1012014320540524435 |
7 | 31121612004222002 |
oct | 2774755073250407 |
9 | 453884328481265 |
10 | 105344423252231 |
11 | 30625356669929 |
12 | b99455625071b |
13 | 46a1c23602b77 |
14 | 1c029a9516539 |
15 | c2a3b466518b |
hex | 5fcf68ed5107 |
105344423252231 has 32 divisors (see below), whose sum is σ = 112540633545600. Its totient is φ = 98263987978240.
The previous prime is 105344423252227. The next prime is 105344423252281. The reversal of 105344423252231 is 132252324443501.
It is a cyclic number.
It is not a de Polignac number, because 105344423252231 - 22 = 105344423252227 is a prime.
It is a super-2 number, since 2×1053444232522312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105344423252281) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1033964150 + ... + 1034066028.
It is an arithmetic number, because the mean of its divisors is an integer number (3516894798300).
Almost surely, 2105344423252231 is an apocalyptic number.
105344423252231 is a deficient number, since it is larger than the sum of its proper divisors (7196210293369).
105344423252231 is a wasteful number, since it uses less digits than its factorization.
105344423252231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103339.
The product of its (nonzero) digits is 691200, while the sum is 41.
Adding to 105344423252231 its reverse (132252324443501), we get a palindrome (237596747695732).
The spelling of 105344423252231 in words is "one hundred five trillion, three hundred forty-four billion, four hundred twenty-three million, two hundred fifty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •