Base | Representation |
---|---|
bin | 10001010011011001101… |
… | …111111111111011100111 |
3 | 11012200011221002112022122 |
4 | 101103121233333323213 |
5 | 123440200414242244 |
6 | 2310125404420155 |
7 | 151623056016533 |
oct | 21233157777347 |
9 | 4180157075278 |
10 | 1189064212199 |
11 | 419308826936 |
12 | 17254724765b |
13 | 88188a83656 |
14 | 4179ddb0bc3 |
15 | 20de4ad21ee |
hex | 114d9bffee7 |
1189064212199 has 4 divisors (see below), whose sum is σ = 1189867092960. Its totient is φ = 1188261331440.
The previous prime is 1189064212187. The next prime is 1189064212211. The reversal of 1189064212199 is 9912124609811.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (1189064212187) and next prime (1189064212211).
It is a cyclic number.
It is not a de Polignac number, because 1189064212199 - 28 = 1189064211943 is a prime.
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 1189064212199.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1189064202199) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 401438159 + ... + 401441120.
It is an arithmetic number, because the mean of its divisors is an integer number (297466773240).
Almost surely, 21189064212199 is an apocalyptic number.
1189064212199 is a deficient number, since it is larger than the sum of its proper divisors (802880761).
1189064212199 is an equidigital number, since it uses as much as digits as its factorization.
1189064212199 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 802880760.
The product of its (nonzero) digits is 559872, while the sum is 53.
The spelling of 1189064212199 in words is "one trillion, one hundred eighty-nine billion, sixty-four million, two hundred twelve thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •