Base | Representation |
---|---|
bin | 10101000111011100101… |
… | …000011000010010101011 |
3 | 12010201120001002210200201 |
4 | 111013130220120102223 |
5 | 142233331010122111 |
6 | 3030343444013031 |
7 | 206560514450056 |
oct | 25073450302253 |
9 | 5121501083621 |
10 | 1451105551531 |
11 | 50a457287599 |
12 | 1b5298391177 |
13 | a6ab971c3ac |
14 | 5033bac1a9d |
15 | 27b2ead56c1 |
hex | 151dca184ab |
1451105551531 has 12 divisors (see below), whose sum is σ = 1499530642536. Its totient is φ = 1404197134560.
The previous prime is 1451105551499. The next prime is 1451105551607. The reversal of 1451105551531 is 1351555011541.
It is not a de Polignac number, because 1451105551531 - 25 = 1451105551499 is a prime.
It is a super-2 number, since 2×14511055515312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1451105554531) 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 in 11 ways as a sum of consecutive naturals, for example, 16256935 + ... + 16345951.
It is an arithmetic number, because the mean of its divisors is an integer number (124960886878).
Almost surely, 21451105551531 is an apocalyptic number.
1451105551531 is a deficient number, since it is larger than the sum of its proper divisors (48425091005).
1451105551531 is an equidigital number, since it uses as much as digits as its factorization.
1451105551531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106042 (or 106011 counting only the distinct ones).
The product of its (nonzero) digits is 37500, while the sum is 37.
The spelling of 1451105551531 in words is "one trillion, four hundred fifty-one billion, one hundred five million, five hundred fifty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •