Base | Representation |
---|---|
bin | 1010011010100010110111… |
… | …0000100000001100101011 |
3 | 1111112201102100220201010022 |
4 | 2212220231300200030223 |
5 | 3000103424012010101 |
6 | 40204330320311055 |
7 | 2261214120154361 |
oct | 246505560401453 |
9 | 44481370821108 |
10 | 11451150500651 |
11 | 3715450a21544 |
12 | 134b38717248b |
13 | 650ab9c85014 |
14 | 2b834ab91631 |
15 | 14cd0d956a1b |
hex | a6a2dc2032b |
11451150500651 has 2 divisors, whose sum is σ = 11451150500652. Its totient is φ = 11451150500650.
The previous prime is 11451150500591. The next prime is 11451150500753. The reversal of 11451150500651 is 15600505115411.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11451150500651 is a prime.
It is a super-2 number, since 2×114511505006512 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11451150500051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5725575250325 + 5725575250326.
It is an arithmetic number, because the mean of its divisors is an integer number (5725575250326).
Almost surely, 211451150500651 is an apocalyptic number.
11451150500651 is a deficient number, since it is larger than the sum of its proper divisors (1).
11451150500651 is an equidigital number, since it uses as much as digits as its factorization.
11451150500651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15000, while the sum is 35.
The spelling of 11451150500651 in words is "eleven trillion, four hundred fifty-one billion, one hundred fifty million, five hundred thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •