Base | Representation |
---|---|
bin | 10000100000001000100… |
… | …000011111001010000111 |
3 | 11000102002101121002021001 |
4 | 100200020200133022013 |
5 | 122034430102200403 |
6 | 2224543041434131 |
7 | 144633632544103 |
oct | 20401040371207 |
9 | 4012071532231 |
10 | 1134014100103 |
11 | 3a7a29439925 |
12 | 16394303b947 |
13 | 82c2498a921 |
14 | 3cc5aa96903 |
15 | 1e771bd7c1d |
hex | 1080881f287 |
1134014100103 has 8 divisors (see below), whose sum is σ = 1201604347520. Its totient is φ = 1067214382200.
The previous prime is 1134014100101. The next prime is 1134014100133. The reversal of 1134014100103 is 3010014104311.
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 1134014100103 - 21 = 1134014100101 is a prime.
It is a super-2 number, since 2×11340141001032 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1134014100101) 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, 197629425 + ... + 197635162.
It is an arithmetic number, because the mean of its divisors is an integer number (150200543440).
Almost surely, 21134014100103 is an apocalyptic number.
1134014100103 is a deficient number, since it is larger than the sum of its proper divisors (67590247417).
1134014100103 is a wasteful number, since it uses less digits than its factorization.
1134014100103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 395264757.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1134014100103 its reverse (3010014104311), we get a palindrome (4144028204414).
The spelling of 1134014100103 in words is "one trillion, one hundred thirty-four billion, fourteen million, one hundred thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •