Base | Representation |
---|---|
bin | 10000100100110010000… |
… | …100110110101110001001 |
3 | 11000212222022121121002222 |
4 | 100210302010312232021 |
5 | 122130141123420303 |
6 | 2231130301303425 |
7 | 145201433140355 |
oct | 20446204665611 |
9 | 4025868547088 |
10 | 1139006466953 |
11 | 3aa060502a43 |
12 | 1648b6b64b75 |
13 | 8353c076054 |
14 | 3d1b1b2c465 |
15 | 1e965132938 |
hex | 10932136b89 |
1139006466953 has 16 divisors (see below), whose sum is σ = 1269950829120. Its totient is φ = 1015208764416.
The previous prime is 1139006466937. The next prime is 1139006466971. The reversal of 1139006466953 is 3596646009311.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1139006466953 - 24 = 1139006466937 is a prime.
It is a super-2 number, since 2×11390064669532 (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 = 1139006466895 and 1139006466904.
It is not an unprimeable number, because it can be changed into a prime (1139006466053) 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 15 ways as a sum of consecutive naturals, for example, 223025 + ... + 1525697.
It is an arithmetic number, because the mean of its divisors is an integer number (79371926820).
Almost surely, 21139006466953 is an apocalyptic number.
It is an amenable number.
1139006466953 is a deficient number, since it is larger than the sum of its proper divisors (130944362167).
1139006466953 is a wasteful number, since it uses less digits than its factorization.
1139006466953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1305416.
The product of its (nonzero) digits is 3149280, while the sum is 53.
The spelling of 1139006466953 in words is "one trillion, one hundred thirty-nine billion, six million, four hundred sixty-six thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •