Base | Representation |
---|---|
bin | 10000110000010000001… |
… | …100101101001011001111 |
3 | 11002001202200100101022001 |
4 | 100300100030231023033 |
5 | 122330402142022201 |
6 | 2240524355333131 |
7 | 146115600020452 |
oct | 20602014551317 |
9 | 4061680311261 |
10 | 1151323001551 |
11 | 404300901758 |
12 | 1671738b11a7 |
13 | 84752977648 |
14 | 3da1d7c5499 |
15 | 1ee3657b301 |
hex | 10c1032d2cf |
1151323001551 has 4 divisors (see below), whose sum is σ = 1151329903632. Its totient is φ = 1151316099472.
The previous prime is 1151323001519. The next prime is 1151323001567. The reversal of 1151323001551 is 1551003231511.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1151323001551 - 25 = 1151323001519 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1151323001501) 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 3 ways as a sum of consecutive naturals, for example, 3194470 + ... + 3536563.
It is an arithmetic number, because the mean of its divisors is an integer number (287832475908).
Almost surely, 21151323001551 is an apocalyptic number.
1151323001551 is a deficient number, since it is larger than the sum of its proper divisors (6902081).
1151323001551 is an equidigital number, since it uses as much as digits as its factorization.
1151323001551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6902080.
The product of its (nonzero) digits is 2250, while the sum is 28.
The spelling of 1151323001551 in words is "one trillion, one hundred fifty-one billion, three hundred twenty-three million, one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •