Base | Representation |
---|---|
bin | 10000000011100111110… |
… | …001110110110010010101 |
3 | 10220111001212012120002021 |
4 | 100003213301312302111 |
5 | 121034230424443013 |
6 | 2202521200213141 |
7 | 142501200145411 |
oct | 20034761666225 |
9 | 3814055176067 |
10 | 1103400234133 |
11 | 395a4973724a |
12 | 159a1a60a1b1 |
13 | 80086383832 |
14 | 3b594cd5d41 |
15 | 1da7e252a8d |
hex | 100e7c76c95 |
1103400234133 has 8 divisors (see below), whose sum is σ = 1111751907840. Its totient is φ = 1095065315760.
The previous prime is 1103400234107. The next prime is 1103400234229. The reversal of 1103400234133 is 3314320043011.
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 1103400234133 - 217 = 1103400103061 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1103400234098 and 1103400234107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103400204133) 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, 4056613 + ... + 4320058.
It is an arithmetic number, because the mean of its divisors is an integer number (138968988480).
Almost surely, 21103400234133 is an apocalyptic number.
It is an amenable number.
1103400234133 is a deficient number, since it is larger than the sum of its proper divisors (8351673707).
1103400234133 is an equidigital number, since it uses as much as digits as its factorization.
1103400234133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8377667.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1103400234133 its reverse (3314320043011), we get a palindrome (4417720277144).
The spelling of 1103400234133 in words is "one trillion, one hundred three billion, four hundred million, two hundred thirty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •