Base | Representation |
---|---|
bin | 11001000100001000011110… |
… | …100000010101101011111010 |
3 | 112110022101011121111000112012 |
4 | 121010020132200111223322 |
5 | 103422043032424204200 |
6 | 1030241154133445522 |
7 | 32135140410200354 |
oct | 3104103640255372 |
9 | 473271147430465 |
10 | 110235142413050 |
11 | 32140509082466 |
12 | 104443861a08a2 |
13 | 496818b187a85 |
14 | 1d315a34000d4 |
15 | cb2707e98a35 |
hex | 64421e815afa |
110235142413050 has 48 divisors (see below), whose sum is σ = 205920049570200. Its totient is φ = 43904424211200.
The previous prime is 110235142413049. The next prime is 110235142413059. The reversal of 110235142413050 is 50314241532011.
It can be written as a sum of positive squares in 12 ways, for example, as 103697524441 + 110131444888609 = 322021^2 + 10494353^2 .
It is a junction number, because it is equal to n+sod(n) for n = 110235142412998 and 110235142413016.
It is not an unprimeable number, because it can be changed into a prime (110235142413059) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20588180 + ... + 25383920.
Almost surely, 2110235142413050 is an apocalyptic number.
110235142413050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110235142413050 is a deficient number, since it is larger than the sum of its proper divisors (95684907157150).
110235142413050 is a wasteful number, since it uses less digits than its factorization.
110235142413050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4797731 (or 4797726 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 110235142413050 its reverse (50314241532011), we get a palindrome (160549383945061).
The spelling of 110235142413050 in words is "one hundred ten trillion, two hundred thirty-five billion, one hundred forty-two million, four hundred thirteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •