Base | Representation |
---|---|
bin | 110001000110101010… |
… | …1001001001010100001 |
3 | 101002012000102120011211 |
4 | 1202031111021022201 |
5 | 3211430242020441 |
6 | 120235422510121 |
7 | 10422105100342 |
oct | 1421525111241 |
9 | 332160376154 |
10 | 105450345121 |
11 | 407a2a75060 |
12 | 1852b135341 |
13 | 9c36a59124 |
14 | 5164c700c9 |
15 | 2b2299ba81 |
hex | 188d5492a1 |
105450345121 has 8 divisors (see below), whose sum is σ = 115043202144. Its totient is φ = 95858565120.
The previous prime is 105450345107. The next prime is 105450345181. The reversal of 105450345121 is 121543054501.
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 105450345121 - 217 = 105450214049 is a prime.
It is a super-2 number, since 2×1054503451212 (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 (105450345181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57271 + ... + 462796.
It is an arithmetic number, because the mean of its divisors is an integer number (14380400268).
Almost surely, 2105450345121 is an apocalyptic number.
105450345121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
105450345121 is a deficient number, since it is larger than the sum of its proper divisors (9592857023).
105450345121 is a wasteful number, since it uses less digits than its factorization.
105450345121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538511.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 105450345121 its reverse (121543054501), we get a palindrome (226993399622).
The spelling of 105450345121 in words is "one hundred five billion, four hundred fifty million, three hundred forty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •