Base | Representation |
---|---|
bin | 100001110011001… |
… | …1000001101010111 |
3 | 2221001001222111210 |
4 | 1003212120031113 |
5 | 4310314242403 |
6 | 304312232503 |
7 | 40050660264 |
oct | 10346301527 |
9 | 2831058453 |
10 | 1134134103 |
11 | 532209813 |
12 | 27799b733 |
13 | 150c7258b |
14 | aa8a626b |
15 | 69879b03 |
hex | 43998357 |
1134134103 has 8 divisors (see below), whose sum is σ = 1517523328. Its totient is φ = 753417144.
The previous prime is 1134134093. The next prime is 1134134123. The reversal of 1134134103 is 3014314311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1134134103 - 210 = 1134133079 is a prime.
It is a super-2 number, since 2×11341341032 = 2572520327175229218, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1134134103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1134134123) 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, 667075 + ... + 668772.
It is an arithmetic number, because the mean of its divisors is an integer number (189690416).
Almost surely, 21134134103 is an apocalyptic number.
1134134103 is a deficient number, since it is larger than the sum of its proper divisors (383389225).
1134134103 is a wasteful number, since it uses less digits than its factorization.
1134134103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1336133.
The product of its (nonzero) digits is 432, while the sum is 21.
The square root of 1134134103 is about 33676.9075628983. The cubic root of 1134134103 is about 1042.8490981597.
Adding to 1134134103 its reverse (3014314311), we get a palindrome (4148448414).
The spelling of 1134134103 in words is "one billion, one hundred thirty-four million, one hundred thirty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •