Base | Representation |
---|---|
bin | 110001000011100011… |
… | …1101001100010110001 |
3 | 101001220202100121201002 |
4 | 1202013013221202301 |
5 | 3211222103110213 |
6 | 120221221251345 |
7 | 10416401311265 |
oct | 1420707514261 |
9 | 331822317632 |
10 | 105346144433 |
11 | 4074a174592 |
12 | 18500263b55 |
13 | 9c1b2a460a |
14 | 51550a80a5 |
15 | 2b18767658 |
hex | 18871e98b1 |
105346144433 has 8 divisors (see below), whose sum is σ = 106834343040. Its totient is φ = 103866674800.
The previous prime is 105346144399. The next prime is 105346144439. The reversal of 105346144433 is 334441643501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105346144433 - 214 = 105346128049 is a prime.
It is a super-2 number, since 2×1053461444332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105346144439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2157935 + ... + 2206212.
It is an arithmetic number, because the mean of its divisors is an integer number (13354292880).
Almost surely, 2105346144433 is an apocalyptic number.
It is an amenable number.
105346144433 is a deficient number, since it is larger than the sum of its proper divisors (1488198607).
105346144433 is a wasteful number, since it uses less digits than its factorization.
105346144433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4364487.
The product of its (nonzero) digits is 207360, while the sum is 38.
Adding to 105346144433 its reverse (334441643501), we get a palindrome (439787787934).
The spelling of 105346144433 in words is "one hundred five billion, three hundred forty-six million, one hundred forty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •