Base | Representation |
---|---|
bin | 10111111100111101101000… |
… | …111011010011011000100001 |
3 | 111210222211100222112100212011 |
4 | 113330331220323103120201 |
5 | 102301430334322322340 |
6 | 1012014320540432521 |
7 | 31121612004162634 |
oct | 2774755073233041 |
9 | 453884328470764 |
10 | 105344423245345 |
11 | 30625356664739 |
12 | b994556248741 |
13 | 46a1c235cc9ab |
14 | 1c029a9513c1b |
15 | c2a3b46630ea |
hex | 5fcf68ed3621 |
105344423245345 has 96 divisors (see below), whose sum is σ = 137411223206400. Its totient is φ = 77525840209664.
The previous prime is 105344423245301. The next prime is 105344423245349. The reversal of 105344423245345 is 543542324443501.
It is not a de Polignac number, because 105344423245345 - 237 = 105206984291873 is a prime.
It is a super-2 number, since 2×1053444232453452 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105344423245349) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 13455663891 + ... + 13455671719.
It is an arithmetic number, because the mean of its divisors is an integer number (1431366908400).
Almost surely, 2105344423245345 is an apocalyptic number.
It is an amenable number.
105344423245345 is a deficient number, since it is larger than the sum of its proper divisors (32066799961055).
105344423245345 is an frugal number, since it uses more digits than its factorization.
105344423245345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8224 (or 8149 counting only the distinct ones).
The product of its (nonzero) digits is 13824000, while the sum is 49.
Adding to 105344423245345 its reverse (543542324443501), we get a palindrome (648886747688846).
The spelling of 105344423245345 in words is "one hundred five trillion, three hundred forty-four billion, four hundred twenty-three million, two hundred forty-five thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •