Base | Representation |
---|---|
bin | 10000000000100000001… |
… | …010000111101001010011 |
3 | 10220011102110022112022122 |
4 | 100000200022013221103 |
5 | 121010401043321233 |
6 | 2201205001524455 |
7 | 142322202336056 |
oct | 20004012075123 |
9 | 3804373275278 |
10 | 1100051151443 |
11 | 394590218912 |
12 | 159244aa372b |
13 | 7c9715777ba |
14 | 3b3581c0a9d |
15 | 1d935206d98 |
hex | 10020287a53 |
1100051151443 has 2 divisors, whose sum is σ = 1100051151444. Its totient is φ = 1100051151442.
The previous prime is 1100051151439. The next prime is 1100051151523. The reversal of 1100051151443 is 3441511500011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1100051151443 - 22 = 1100051151439 is a prime.
It is a super-2 number, since 2×11000511514432 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1100051156443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550025575721 + 550025575722.
It is an arithmetic number, because the mean of its divisors is an integer number (550025575722).
Almost surely, 21100051151443 is an apocalyptic number.
1100051151443 is a deficient number, since it is larger than the sum of its proper divisors (1).
1100051151443 is an equidigital number, since it uses as much as digits as its factorization.
1100051151443 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 1100051151443 its reverse (3441511500011), we get a palindrome (4541562651454).
The spelling of 1100051151443 in words is "one trillion, one hundred billion, fifty-one million, one hundred fifty-one thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •