Base | Representation |
---|---|
bin | 10000100000011101001… |
… | …110001100100010011101 |
3 | 11000102222121112021020111 |
4 | 100200131032030202131 |
5 | 122041133034024111 |
6 | 2225041334250021 |
7 | 144645352510315 |
oct | 20403516144235 |
9 | 4012877467214 |
10 | 1134361626781 |
11 | 3a8097624859 |
12 | 163a1b4b6911 |
13 | 82c7b989106 |
14 | 3cc90cbc445 |
15 | 1e792483a21 |
hex | 1081d38c89d |
1134361626781 has 8 divisors (see below), whose sum is σ = 1139577120864. Its totient is φ = 1129151658000.
The previous prime is 1134361626763. The next prime is 1134361626821. The reversal of 1134361626781 is 1876261634311.
It is a happy number.
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 1134361626781 - 219 = 1134361102493 is a prime.
It is a super-2 number, since 2×11343616267812 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1134361626581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 969495 + ... + 1791268.
It is an arithmetic number, because the mean of its divisors is an integer number (142447140108).
Almost surely, 21134361626781 is an apocalyptic number.
It is an amenable number.
1134361626781 is a deficient number, since it is larger than the sum of its proper divisors (5215494083).
1134361626781 is a wasteful number, since it uses less digits than its factorization.
1134361626781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2762651.
The product of its digits is 870912, while the sum is 49.
The spelling of 1134361626781 in words is "one trillion, one hundred thirty-four billion, three hundred sixty-one million, six hundred twenty-six thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •