Base | Representation |
---|---|
bin | 10000110000010101011… |
… | …110000110010100001011 |
3 | 11002001222211202212201022 |
4 | 100300111132012110023 |
5 | 122331042312301201 |
6 | 2240541235143055 |
7 | 146121022550165 |
oct | 20602536062413 |
9 | 4061884685638 |
10 | 1151411447051 |
11 | 404346821108 |
12 | 167199444a8b |
13 | 847680a3b68 |
14 | 3da2b449935 |
15 | 1ee3e1ec41b |
hex | 10c1578650b |
1151411447051 has 2 divisors, whose sum is σ = 1151411447052. Its totient is φ = 1151411447050.
The previous prime is 1151411447041. The next prime is 1151411447089. The reversal of 1151411447051 is 1507441141511.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1151411447051 - 218 = 1151411184907 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (1151411447041) 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 as a sum of consecutive naturals, namely, 575705723525 + 575705723526.
It is an arithmetic number, because the mean of its divisors is an integer number (575705723526).
Almost surely, 21151411447051 is an apocalyptic number.
1151411447051 is a deficient number, since it is larger than the sum of its proper divisors (1).
1151411447051 is an equidigital number, since it uses as much as digits as its factorization.
1151411447051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11200, while the sum is 35.
Adding to 1151411447051 its reverse (1507441141511), we get a palindrome (2658852588562).
The spelling of 1151411447051 in words is "one trillion, one hundred fifty-one billion, four hundred eleven million, four hundred forty-seven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •