Base | Representation |
---|---|
bin | 10000000011011001001… |
… | …000001010101001110011 |
3 | 10220110102201200010120101 |
4 | 100003121020022221303 |
5 | 121033230013040220 |
6 | 2202440535453231 |
7 | 142462123615150 |
oct | 20033110125163 |
9 | 3813381603511 |
10 | 1103154424435 |
11 | 395932a05838 |
12 | 159970227217 |
13 | 8004747a4cb |
14 | 3b5703cb227 |
15 | 1da6789a30a |
hex | 100d920aa73 |
1103154424435 has 16 divisors (see below), whose sum is σ = 1578675649536. Its totient is φ = 723559671648.
The previous prime is 1103154424433. The next prime is 1103154424457. The reversal of 1103154424435 is 5344244513011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1103154424435 - 21 = 1103154424433 is a prime.
It is a super-2 number, since 2×11031544244352 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1103154424394 and 1103154424403.
It is not an unprimeable number, because it can be changed into a prime (1103154424433) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 685188279 + ... + 685189888.
It is an arithmetic number, because the mean of its divisors is an integer number (98667228096).
Almost surely, 21103154424435 is an apocalyptic number.
1103154424435 is a deficient number, since it is larger than the sum of its proper divisors (475521225101).
1103154424435 is a wasteful number, since it uses less digits than its factorization.
1103154424435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1370378202.
The product of its (nonzero) digits is 115200, while the sum is 37.
Adding to 1103154424435 its reverse (5344244513011), we get a palindrome (6447398937446).
The spelling of 1103154424435 in words is "one trillion, one hundred three billion, one hundred fifty-four million, four hundred twenty-four thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •